📄️ Heap Sort
The heap is a data structure which is using arrayList to represent a binary tree. However this binary tree is not a valid binary search tree and heap binary tree must be a complete tree which means all the child must be filled from the left to the right. There are two types of heap max heap and min heap.
📄️ Iterative
Bubble Sort
📄️ Radix Sort
A special sorting algorithm that it doesn't sorted by comparing the two items directly, instead it create ten digit buckets and store itmes from their digit and shift from 0. By doing these method in longest nums, the array will be sorted.
📄️ Recursive
Merge Sort