# Diagram heap sort, take you thoroughly understand clear!

As one of sorting algorithms, heapsort cleverly uses the properties of binary tree to achieve sorting. This paper uses the graphical way, clear and thorough, at a glance. Check it out

As one of sorting algorithms, heapsort cleverly uses the properties of binary tree to achieve sorting. This paper uses the graphical way, clear and thorough, at a glance. Check it out

The idea of bubble sort is to compare adjacent elements in pairs. When an element is larger than the adjacent element on the right, they are swapped. When an element is less than or equal to the adjacent element on the right, the position is unchanged to achieve code optimization 1: mark whether the ordered optimization 3: ordered area optimization

Last time to write the data structure and algorithm in the sorting algorithm auxiliary tools class and three basic sorting, details see data structure and algorithm - sorting algorithm auxiliary tools to write and three basic sorting algorithms (Java implementation). But later on, when I learned other algorithms, I found that they judge whether an array is ordered

The sort we've seen before, selection sort, bubble sort, insertion sort, merge sort, and quicksort are all comparation-based sorts, but bucket sort offers a new idea, which is sort based on the state of the data. Sort counting under the idea of bucket sort sort radix sort features bucket sort

This series of articles to "algorithm diagram" and "Learning JavaScript algorithm" two books as the core, the rest of the materials as assistance, and with the author's insights. Strive to simple, interesting language to bring everyone to appreciate the magic of this algorithmic world.

Implementation of thought quicksort is the fastest sorting method known in practice. Quicksort uses the idea of divide and conquer, which also means recursion in your code. Select any element in A, pivot, that serves as the base. Move elements less than the base to the left of the base to be greater than

Thought insertion sort, you can think of it like we're playing poker. When we get the first card, our hand is in order. When we get the second card, we need to compare the left or right side of the first card that we put the second card in. When you get the third card, you need to insert it in the right place in order. .

In previous articles, we analyzed bubble sort, insertion sort, and selection sort. But their actual complexity is order n squared. Let's do merge sort this time with less time. The idea of merge sort is to use the divide-and-conquer idea, and the divide-and-conquer model has three steps on each level of recursion

## What is radix sort? Basic idea: Radix sort is sorted by low order first, then collect; Then sort it in high order and collect it again; And so on, until the highest bit of intuitive expression: is to split each number according to its number of digits, each of the corresponding number of comparison sorting

To tell you the truth, I was doing pretty well a year ago. Because that will not be all postgraduate entrance examination, examination is the data structure and algorithm, many classical data structure and algorithm are skilled in the heart.

Search

Categories

About

mo4tech.com (Moment For Technology) is a global community with thousands techies from across the global hang out!Passionate technologists, be it gadget freaks, tech enthusiasts, coders, technopreneurs, or CIOs, you would find them all here.