Functionsยง
- array_
reversal_ 0 - Iteratively reverses the elements of an array in O(n) time
- array_
reversal_ 1 - array_
reversal_ 2 - array_
sum_ 0 - array_
sum_ 1 - array_
sum_ 2 - array_
sum_ 4 - bin_
search_ 0 - Recursive implementation of a binary search in O(log n) time. Returns the index of the target within a given array, if present. Otherwise the function returns -1.
- bin_
search_ 0_ wrapper - bin_
search_ 1 - Iterative reimplementation of a recursive binary search algorithm in O(log n) time. This algorithm takes a referenced vec and returns the index of the target, if it exists. Otherwise it returns -1 to indicate that the target is not in the vec.
- disk_
usage - factorial_
0 - Computs a n! up to 12 in O(n) time
- factorial_
2 - Recursive implementation of a factorial calculator up to 12! in O(n) time
- factorial_
3 - Iterative implementation of a factorial calculator up to 12! in O(n) time
- factorial_
4 - Iterative implementation of a factorial calculator up to 12! in O(n) time
- fib_0
- powers_
0 - powers_
1 - powers_
2 - powers_
3 - tower_
of_ hanoi - A recursive implementation of the Tower of Hanoi solution that runs in O(2^n) time. This algorithm works by breaking the problem set into source, auxiliary, and destination pegs.