Binary Search
An efficient way to find an element in a sorted list
Counting sort
A non-comparison sorting algorithm that works if the possible elements are a small range of positive integers
Floyd's cycle-finding
A constant-space cycle finding algorithm.
Heapsort
Sorts by using a heap

Photo by Nagae / CC BY 2.5
Insertion sort
Sorts by sorting one element at a time
Linear Search
Go through everything to find element
Merge sort
Sorts by dividing into smaller sublists and then merging sublists together
Quicksort
Sort by picking a pivot and partitioning elements into two sides and then repeat recursively.
Sorting
Organizing a collection in an ordered manner

Photo by Gaz1502 / CC BY 3.0
zstd
A lossless data compression algorithm