"Ah ha!" Algorithm. Ah, Halle. Scanned version of PDF

: Network Disk Download

Content Introduction· · · · · ·

It's just an interesting algorithmic book. Compared to other algorithmic books, if you want to say what it is, you can read it.

This is a smart and interesting algorithm primer book. No dull description, no hard-to-understand formula, everything to the practical application as the starting point,

The algorithm is explained in humorous language with lovely illustrations. You're more likely to be reading a simple little story or playing a fun puzzle.

Game, in a relaxed and enjoyable to grasp the essence of the algorithm, feel the beauty of the algorithm.

The data structures involved in this book are stacks, queues, lists, trees, and check sets, heaps and graphs, etc., and the algorithms involved are sorted, enumerated,

Depth and breadth first search, graph traversal, of course, there is no missing four shortest path algorithm in graph theory, two minimum spanning tree algorithm,

Cutting point and cutting edge algorithm, the maximum matching algorithm, such as two-part graph.

Network Name Ah Halle.

Has played in the Chinese Academy of Sciences single-chip computer. Wuhan University in the history of the first as an undergraduate to join MSRA (Microsoft Research Asia) small partner, in or engaged in search engine research.

Publication of an international conference paper (IEEE).

National Youth Informatics Olympic gold coach.

Super simple C language Compiler--"Aha C Compiler" author.

2013 my books, interesting Programming science book "Aha C!" Published

Website: www.ahalei.com

Weibo: Weibo.com/ahalei

Very fond of children, every day has been very happy.

As for why it is called "Ah Halle", because I think this is a very festive name.

about the author· · · · · ·

Network Name Ah Halle.

Has played in the Chinese Academy of Sciences single-chip computer. Wuhan University in the history of the first as an undergraduate to join MSRA (Microsoft Research Asia) small partner, in or engaged in search engine research.

Publication of an international conference paper (IEEE).

National Youth Informatics Olympic gold coach.

Super simple C language Compiler--"Aha C Compiler" author.

2013 my books, interesting Programming science book "Aha C!" Published

CatalogueThe 1th chapter of a large wave is approaching--sort 1
1th fastest and simplest sort-bucket sort 2
2nd-neighbor Good talk-bubble sort 7
3rd most commonly used sort-quick sort 12
4th quarter hum buy book 20
2nd Chapter stack, queue, linked list 25
The 1th section decrypts QQ number--queue 26
2nd section decryption Palindrome--Stack 32
3rd card Game-Kitten fishing 35
4th Section List 44
5th section Analog List 54
3rd Zhang Yi Lift! Very violent 57
1th Pit Daddy's number 58
2nd Quarter Bomb man 61
3rd Quarter Match Stick Equation 67
The full arrangement of the 4th section 70
The 4th chapter of Universal Search 72
1th section does not hit the south wall does not look back--depth first search 73
Section 2nd rescue Xiao Ha 81
3rd section layer progression--breadth First search 88
4th, then the Bomber 95.
5th Treasure Island Adventure 106
6th Water-saving Plumber game 117
Chapter 5th traversal of the graph 128
1th section depth and breadth first what exactly is 129
The 2nd section City map--depth first traversal of the graph 136
3rd Section Minimum Transfer--the breadth of the chart first traverse 142
6th. Shortest Path 147
The 1th verse only the five elements of the algorithm--floyd-warshall 148
2nd Section Dijkstra algorithm--Relaxation by edges 155
The 3rd section bellman-ford--solves the negative right side 163
4th section Bellman-ford Queue Optimization 171
The 5th section of the Shortest Path algorithm comparative analysis 177
7th Magic Tree 178
The 1th section opens the "Tree" tour 179
2nd Quarter binary Tree 183
3rd heap-The magical priority queue 185
4th, catch the thief first--and check the episode 200
8th more Wonderful Algorithms 211
1th Biaoju Dart--the smallest spanning tree of graphs 212
The 2nd section again on the minimum spanning tree 219
The 3rd section of the important city-the cut point of the figure 229
The 4th section of the key road-the cutting edge of the figure 234
5th, I'm going to do matchmaker--two-figure maximum match 237
9th chapter can be better--Microsoft Research Asia interview 243

: Network Disk Download

"Ah ha!" Algorithm. Ah, Halle. Scanned version of PDF