![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
algorithm
skywatercomputer
这个作者很懒,什么都没留下…
展开
-
insertion-sort
The core idea of the insertion sort is to place an element in the appropriate location in the array.The detail steps of this algorithm are as follows:1. Choose an element from left to right, and ...原创 2018-03-27 10:36:56 · 594 阅读 · 0 评论 -
selection-sort
The core idea of the selection sort is to choose the minimum/maximum element from the remaining elements in the array, and then put it to the end of the elements that you have already sorted.The detai...原创 2018-03-27 11:13:26 · 144 阅读 · 0 评论 -
merge-sort
Divide and conquer is the core idea of merge sort. You can recursively divide the original array into two sub-arrays, until each sub-array only has one element. At the last, it looks like a tree, the ...原创 2018-03-28 14:51:52 · 449 阅读 · 0 评论 -
find largest sub array
There are two ways to solve the problem of largest sub array:1: divide-and-conquer method2: linear search methodNow let me introduce them one by one.1: divide-and-conquer methodThe core idea of it is ...原创 2018-04-17 09:58:40 · 205 阅读 · 0 评论 -
quick sort and randomized quick sort
The idea of classic quick sort is to divided the original array to two parts, and the when you doing the partition, you should make sure the element in left subarray always less than a pivot, and ...原创 2018-05-04 12:51:58 · 210 阅读 · 0 评论