Pinned

1. Gunbarrel-Optimizer Gunbarrel-Optimizer Public

   Python

2. insertionSort.Rmd insertionSort.Rmd

   1

   ```{R}

   2

   # Insertion Sort w/ Binary Search indexing

   3

   # overall insertion sort is still O(n^2) due to copying elements around, although swapped index searching is O(logn)

   4

   5

   # returns first idx <= insertion_idx where arr[idx] > val, or returns insertion_idx if no idx exists (ie, all numbers <= val)

3. Arps Arps Public

   Python

4. Polygon-Proposal-Algo Polygon-Proposal-Algo Public

   Python