Turing algorithm group "AHA algorithm" bribed

--Turing Algorithm Group reading program (Phase I)

Bribed Person: Zoctopus Lian

Featured in this book

• An introductory book of algorithms full of intelligence and fun. There is no dull description, no hard-to-understand formula, and everything is based on practical application.
• The data structures involved in the 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.
• The book is a humorous language with cute illustrations to explain the algorithm, using C language implementation.

Suitable for readers

Ideal for algorithmic 0 basics and love programming friends (because there are lots of interesting puzzles, games).

read duration (estimated): three weeks, average 70 pages per week.

time schedule: Once a week, scheduled for every Sunday 8 o'clock in the evening-9 hour answer (at the dead of Night).

Read suggestions

Since is an introduction to the algorithm (C language implementation), so of course, will not start from Hello World, so please review the basic knowledge of C language previously learned, nothing to write a few procedures to practice practiced hand.

Reading planning

This book has a total of eight chapters (36 sections) of the content, of which the eighth chapter for you to explore, there are doubts can be put in the group to discuss, so I only list the first seven chapters of the content of the reading plan.

First part: 1-3 chapters, 13 knots, total 71 pages

Reading time: 1 weeks, remember to operate the machine.

Key content

• Sorting algorithms
• Basic data structure: queue, stack, linked list
• Enumeration algorithm

Difficult content

• Implementation of the analog linked list
• Operation of the kitten fishing game

Part II: 4-5 Chapters, 9 knots, total 75 pages

Reading time: 1 weeks, remember to operate the machine.

Key content

• Depth-First Search Dfs
• Breadth First search BFS
• The concept of graphs

Difficult content

• Plumber's Game (SELECT, do not make mandatory)
• Treasure Island Adventure (seed filling method)

Part III: 6-7 Chapters, 9 knots, total 64 pages

Reading time: 1 weeks, remember to operate the machine.

Key content

• Dijkstra algorithm
• Comparative analysis of Shortest path algorithm
• Two-fork Tree

Difficult content

• Bellman-ford algorithm
• The use of heaps
• and check Set

Written in the last

For the first time as a bribed person to write this reading plan, the heart is still excited and nervous. Of course, bribed people are not omnipotent, but also with everyone to learn, common progress (of course I must learn a little beforehand, otherwise how can bribed it). So, if I know, I will tell you, if I do not know or not clear, will not be easy to tell you. Learn knowledge, to clear their own shortcomings, to do deeds.

I wish you all a pleasant reading ~

Turing algorithm group "AHA algorithm" bribed