What is Insertion? Insertion sort is a simple sort algorithm. The basic logic of is that from the head to the tail of the array, if the previous one is larger than the next one, swap them and loop...

Step1 What is heap? To understand the definition of the heap, it is necessary to learn about binary tree, especially the complete binary tree. From Wiki: Binary Tree: In computer science,...

Step1: What is merge? To understand the merge sort better, we need to learn merge first. Imagining two arrays which are sorted, we want to merge them to get a new sorted array. The simplest way is...

Step1: Where is the quick sort from? In a out-of-order array, if we fixed one of them and name it “pivot”, such as the middle one or the first one, and next we divided the array into two parts(lef...