Jonathan Speek

{ CS musings & coffee }

A common (but slow and confusing) way of calculating the greatest common divisor is using an iterative algorithm to solve. Something like th [...]


/ Jonathan Speek

Merge Sort

Merge Sort is an algorithm used to sort an array or list that is considered to have a complexity O(n log n). Merge sort takes advantage of a [...]


/ Jonathan Speek

Binary Search

Binary Search is a search algorithm that finds a value within a sorted array or list. Binary search runs in at worst logarithmic time, makin [...]


/ Jonathan Speek

Bubble Sort

Bubble Sort is an algorithm used to sort an array or list that is considered to have a complexity O(n²). It compares adjacent elements and s [...]


Selection Sort is an algorithm used to sort an array or list that is considered to have a complexity O(n²). This sorting algorithm is consid [...]