Sorting Algorithms

- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort

Bubble sort is a sorting algorithm that will sort an array of numbers.

This algorithm sorts the array of numbers by considering which number in the array is the smallest value.

Insertion sort sorts an array by compairing indexes and swapping indexes accordingly. Click on the link to learn more.

Quick sort is an efficient sorting algorithm that works by recursively partitioning and sorting the data around a pivot index's value.

Searching Algorithms

- Linear Search
- Binary Search

This algorithm sequentially checks each element of a list of values for the target value until a match is found or until all the elements have been searched

This algorithm sorts an array by dividing the search interval in half.

Shuffling Algorithms

- Fisher Yates

This algorithm shuffles the sequence of numbers.