🪴 Algorithms
Binary Search
only works if the array is sorted
Recursion
A process that calls itself
- base case
- step case (split the problem)
Tail Recursion
- guard clauses to add exit points
Array Splitting
- remove the unused half
Array View
- ArrayView wrapper to give back fixed memory
- provides better data structure without making new array
Array Partition
- use new data structure to abstract bounds for recursive binary search