Paper discussion: mathematical induction of algorithms and data structures, recursion, and leftist heap)

AlgorithmAnd data structure are the core contents of computer science. AsProgramPersonnel, programming is our practical project. However, writing programs is not enough. It takes a lot of time for a program to cope with large and complex situations. We can easily write a program that finds a word from a file, such as word-by-word scanning, to check whether it is consistent. However, if our files contain dozens of terabytes of data and hundreds of words are to be found in the files, scanning them one by one is almost impossible. We need to optimize the program so that our program can cope with complex problems.AlgorithmResearch and SolutionMethod, AndData StructureIs to design a betterOrganize data and use data. The two are strongly interdependent, so they are often discussed together.

 

I will take this seriesArticleThe title is "paper discussion ". Historically, Zhao Kuo was the one who talked on paper. He is the son of Zhao guozhi. Zhao Kuo is familiar with military books, but he has never been on the battlefield. He replaced Lian Po's command Zhao Jun and confronted Qin Jun. He was eager to attack, causing Zhao Jun to fall into a trap and fail to fight. Zhao Guo was killed by 0.4 million of the soldiers, and Zhao Guo suffered a loss.

Like Bing Shu, the core of "algorithms and data structures" is to solve computer problems.Basic PrinciplesAndTypical Cases. Unlike grammar books that introduce languages, "algorithms and data structures" cannot cure all diseases. In many cases, programmers need to modify existing algorithms or create algorithms to solve the problem. After reading the war books, you must use them to understand the algorithm. I am still in the phase of talking on paper, so I encourage myself in the title of "talking on paper. In this series, I will briefly describe some classic algorithms and data structuresBasic IdeasAnd share my self-written information.ImplementationCode. These codes are purely written to deepen your understanding, so there are many immature aspects. I personally think this is a good way to learn. You can ignore the code I wrote and implement it on your own.

I hope it will be useful to you.

 

Mathematical induction, recursion, stack

Sorting Algorithm

 

Table (list)

Stack)

Queue)

Tree, binary tree, Binary Search Tree

AVL Tree

Splay tree)

Heap)

Leftist heap)

Hash table)

 

To be continued...

 

==============================

The following are reference books:

Bean Column

Http://book.douban.com/doulist/1938922/#sb1237002