The Quicksort algorithm was first proposed by Charles Antony Richard Hoare, also called the partition-exchange sort algorithm. The Quicksort algorithm has high execution efficiency in general and is widely used in practical engineering.
Have you ever been confused by recursive algorithms? If so, don't miss the RecursiveTree class provided by algviz. You can easily see the recursive running process of the algorithm by simply calling the corresponding interface in the algorithm.
The merge sort algorithm uses the idea of divide and conquer, which reduces the big things to small ones and solves the small thing recursively, then gather the solutions together! The idea of divide and conquer includes the divide, resolve, and merge processes.
Bubble sort is a sorting algorithm that we are familiar with. It is named after the algorithm that runs like bubbles emerging from the water.
Insertion sort is a simple and naive sorting method, which processes the unsorted elements in the unordered part sequentially and inserts them into the correct position in the sorted part.