This repository contains implementations of popular sorting and searching algorithms in Javascript. The algorithms included are Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Binary Search. Each algorithm is explained in detail below.
Selection Sort is a simple comparison-based sorting algorithm. It works by dividing the array into a sorted and an unsorted region. In each iteration, it finds the minimum element in the unsorted region and swaps it with the first element of the unsorted region.
- Time Complexity: O(n^2)
- Space Complexity: O(1)
Insertion Sort is another simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
- Time Complexity: O(n^2)
- Space Complexity: O(1)
Merge Sort is a divide-and-conquer algorithm that divides the input array into two halves, recursively sorts each half, and then merges the sorted halves.
- Time Complexity: O(n log n)
- Space Complexity: O(n)
Quick Sort is another efficient divide-and-conquer sorting algorithm. It works by selecting a 'pivot' element and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot.
- Time Complexity: O(n log n)
- Space Complexity: O(log n) - average, O(n) - worst
Binary Search is an efficient search algorithm that works on sorted arrays. It repeatedly divides the search space in half until the target element is found or the search space is empty.
- Time Complexity: O(log n)
- Space Complexity: O(1)