* Naïve implementation, takes O(N) for each request. */

TODO: resize

* Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares * each pair of adjacent items and swaps the

Builder

Decorator:

Kotlin 1.1 declared as top level class/object in the same file

* Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection * sort where we first find the ma

* The class represents set of comparables. The values are stored in a sorted array, * and the inclusion queries perform binary search, taking logarit

* Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. * Each iteration, insertion sort removes on

* Kruskal's algorithm will grow a solution from the cheapest edge by adding the next cheapest edge, * provided that it doesn't create a cycle. */

* Invented in 1945 by John von Neumann, merge sort is an efficient algorithm using the divide and conquer approach * which is to divide a big problem

* Developed by Tony Hoare in 1959, with his work published in 1961, Quicksort is an efficient sort algorithm using * divide and conquer approach. Qui

Proxy:

* Selection sort is a simple sorting algorithm dividing the input list into two parts: the sublist of items already * sorted, which is built up from

* Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a * generalization of sorting by ex

Facade: