Last time I practiced the binary search algorithm and then implemented it on JavaScript. This time I learned about Selection Sort. A selection sort is a sorting algorithm that will take an array of numbers (or strings) and then sort them into ascending order. If I give an input of [1, 5, 3, 4, 2] it will output [1, 2, 3, 4, 5]. In a nutshell I start with the first item of the list. Then I … [Read more...] about Notes on Algorithms 2, Selection Sort

# Algorithm

## Binary Search Algorithm in JavaScript

Binary Search algorithm cuts the list in half to find the given item. Here I will be implementing binary search algorithm in JavaScript. Pseudo code: Create a variable min, set it to 0Create a variable max, set it to array length - 1Create a variable guessWhile min is less than or equal max, keep goingAdd min and max and divided them by 2; make it an integerif the target value equals the … [Read more...] about Binary Search Algorithm in JavaScript

## Notes on Algorithms 1, Binary Search

Algorithms are recipes to come up with a solution. Large algorithms are actually a collection of lots of smaller algorithms. When it comes to working with lots of data, making an efficient algorithm becomes important. The study of algorithms is needed to build big systems. This could result in the saving of computer time which translates into money saved. There are bunch of popular algorithms … [Read more...] about Notes on Algorithms 1, Binary Search