Jonathan Speek

{ CS musings & coffee }

/ 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 [...]


/ Jonathan Speek

Insertion Sort

Insertion Sort is an algorithm used to sort an array or linked list considering one element (or node) at a time. This sorting algorithm is g [...]