Algorithms

WIP

Additionally see Big O Notation and Data Structures.

Definition

Its the code you write that solves problems :)

“In computer programming terms, an algorithm is a set of well-defined instructions to solve a particular problem.”

Search algorithm to find a target value in a sorted array, with each iteration half the values are eliminated.

Quick Sort

Choose a pivot and swap elements that are smaller to the left of the pivot and bigger to the right of the pivot

Merge Sort

Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves.

TODO

1
2
3
4
5
6
7
8
9
10
Bubble Sort
Bucket Sort
Cube Sort
Counting Sort
Heap Sort
Insertion Sort
Radix Sort
Shell Sort
Time Sort
Tree Sort

References