Rust

Implementations

• Binary search

  Find a key in a sorted array. Compare the key with the middle item, and keep only the half that can hold the key.

  Θ(log n) worst · average intro
• Insertion sort

  Sort an array one item at a time. Take the next item and move it left until the item before it is not larger.

  Θ(n²) worst · average intro
• Merge sort

  Sort an array by divide and conquer. Sort each half, then merge the two sorted halves into one sorted array.

  Θ(n log n) worst · average · best intro