aanchirinah

This gist contains implementations of:
1. Breadth first search
2. Depth first search
3. Dijkstra search

aanchirinah

In this gist we have 
1. Insertion sort algorithm
2. Heap sort algorithm
3. Quick sort algorithm
4. Merge sort algorithm

aanchirinah

onInputChange = e => {
    this.setState({
      [e.target.name]: e.target.value
    });
  };

aanchirinah

  // Deletes keys with no data ES 6
  Object.keys(data).forEach(key => data[key] === null && delete data[key]);

aanchirinah

const key = 'DYNAMIC_KEY',
    obj = {
        [key]: 'ES6!'
    };

console.log(obj);
// > { 'DYNAMIC_KEY': 'ES6!' }

aanchirinah

const binarySearch = (arr, target) => {
    let left = 0;
    let right = arr.length - 1;
    while (left <= right) {
        const mid = left + Math.floor((right - left) / 2);
        if (arr[mid] === target) {
            return mid;
        }
        if (arr[mid] < target) {
            left = mid + 1;

aanchirinah

const linearSearch = (array, target) => {
  for(let i = 0; i < array.length; i++){
    if(array[i] === target) return i;
  }
  return -1;
}