Valentin Podkamennyi vpodk

## binary-search.js
/**
 * Binary search is a search algorithm that finds the position of a target value within a sorted array.
 * Binary search has O(log n) complexity.
 * @param {!Array} list The sorted array.
 * @param {*} item The item to search.
 * @return {number} Returns the index of the item in the array.
 * @see https://en.wikipedia.org/wiki/Binary_search_algorithm
 */
const binarySearch = (list, item) => {
  let low = 0;

## clap-nav-theme.css
nav ul,
nav a {
  background-color: Indigo;
  color: White;
}

nav .menu a.active,
nav .menu a:active,
nav .menu a:hover {
  background-color: DarkMagenta;

## clap-nav.css
nav {
  display: block;
  float: right;
  left: -1em;
  padding-top: .2em;
  position: absolute;
  user-select: none;
  width: 100%;
  z-index: 1;
  -webkit-user-select: none;

## clap-nav-index.html
<header>
  <h1>Header</h1>
  <nav id="nav">
    <input type="checkbox" aria-label="Toggle menu">
    <div class="hamburger"><span></span></div>
    <ul class="menu">
      <li><a href="./index.html">Home</a></li>
      <li><a href="./index.html">About</a></li>
      <li><a href="./index.html">Contact</a></li>
    </ul>

## clap-positions-app.css
body {
  font-family: arial, sans-serif;
  -webkit-font-smoothing: antialiased;
}

#main {
  margin: 5em auto 0;
}

header,

## clap-layout-theme.css
body {
  background-color: White;
  color: DarkSlateGray;
}
header,
footer {
  background-color: Indigo;
  color: White;
}
#main > aside {

## clap-layout-flex-update.css
aside, footer, header, #main > article {
  padding: 1em;
}

## clap-layout-index.html
<body>
  <header>Header</header>
  <div id="main">
    <article>Content</article>
    <aside>Left sidebar</aside>
    <aside>Right sidebar</aside>
  </div>
  <footer>Footer</footer>
</body>

## clap-layout-flex.css
* {
  box-sizing: border-box;
  margin: 0;
  padding: 0;
}

body {
  display: flex;
  flex-direction: column;
  min-height: 100vh;

## merge-sorted-arrays.js
/**
 * Merge two sorted integer arrays nums1 and nums2 into nums1, sorted in non-decreasing order.
 * The time complexity of this function is O(m + n),
 * @param {number[]} nums1 The first sorted array containing elements to be merged.
 * @param {number} m The number of elements in nums1 (excluding additional space for merging).
 * @param {number[]} nums2 The second sorted array containing elements to be merged into nums1.
 * @param {number} n The number of elements in nums2.
 * @see https://leetcode.com/problems/merge-sorted-array/
 */
var merge = function(nums1, m, nums2, n) {
	/**
	* Binary search is a search algorithm that finds the position of a target value within a sorted array.
	* Binary search has O(log n) complexity.
	* @param {!Array} list The sorted array.
	* @param {*} item The item to search.
	* @return {number} Returns the index of the item in the array.
	* @see https://en.wikipedia.org/wiki/Binary_search_algorithm
	*/
	const binarySearch = (list, item) => {
	let low = 0;
	body {
	font-family: arial, sans-serif;
	-webkit-font-smoothing: antialiased;
	}

	#main {
	margin: 5em auto 0;
	}

	header,
	body {
	background-color: White;
	color: DarkSlateGray;
	}
	header,
	footer {
	background-color: Indigo;
	color: White;
	}
	#main > aside {
	<body>
	<header>Header</header>
	<div id="main">
	<article>Content</article>
	<aside>Left sidebar</aside>
	<aside>Right sidebar</aside>
	</div>
	<footer>Footer</footer>
	</body>
	* {
	box-sizing: border-box;
	margin: 0;
	padding: 0;
	}

	body {
	display: flex;
	flex-direction: column;
	min-height: 100vh;
	/**
	* Merge two sorted integer arrays nums1 and nums2 into nums1, sorted in non-decreasing order.
	* The time complexity of this function is O(m + n),
	* @param {number[]} nums1 The first sorted array containing elements to be merged.
	* @param {number} m The number of elements in nums1 (excluding additional space for merging).
	* @param {number[]} nums2 The second sorted array containing elements to be merged into nums1.
	* @param {number} n The number of elements in nums2.
	* @see https://leetcode.com/problems/merge-sorted-array/
	*/
	var merge = function(nums1, m, nums2, n) {