Programmer programming Art 1 ~ Chapter 10 highlights and summary

ProgramMember programming art first ~ Chapter 10 highlights and summary-interview,AlgorithmProgramming

 

Author: July, programming art room.
Source:Http://blog.csdn.net/v_JULY_v .

The programmer programming Art Series (taopp series for short) on the "interview", "algorithm", and "programming" topics started with the first article in April this year and has been around for nearly two months. During the two-month creation, I wrote ten chapters and a total of 13 articles.Article. This is my 4th original works,Microsoft interview 100 series,Red/Black Tree Series, AndThirteen classical algorithm research seriesIn comparison, the author of the programming Art series is more than me, but a studio called the programming art room.

The programming Art series was originally named as the programmer's preference for interview questions. Later, as more and more people joined me to create interview questions, we gradually realized that, serving the interview service should not be our ultimate or major goal, but should pay attentionImprove the programming skills of the majority of beginners, and how to use programming skills and efficient algorithms to solve practical application problems. This is the essence of computer science and programming.. As a result, we changed the programmer's preference series to the programmer's programming Art series, and then determined the creation group as the programming art room. And put forward our purpose, that is, the programming art room is committed to the following three work:

1. To solve a problem, we constantly find more efficient algorithms and program them.
2. Solve the application problems encountered in practice, such as chapter 10, how to sort disk files.
3. Research and Implementation of classical algorithms.

Overall highlights: programming, how to efficiently program to solve practical problems.

At the very beginning, we did not dare to wear the art hat for ourselves, because the extraction of art is a very, very difficult process, and we are all a group of mediocre people. However, we would like to accept this challenge. Therefore, with great fear, we carefully and carefully create each chapter. After the release, we will carefully repeat and ponder over any details of each chapter,Think twice, correct it repeatedly, and improve it repeatedly,Never let go of any problem, vulnerability, or bug. But even so, there are still many problems. Fortunately, many readers and friends gave us enthusiastic guidance on the programming Art series andOptimizationMore importantly, they also patiently and meticulously put forward a lot of extremely valuable criticism and comments on the programming Art series.

Without the creation of all the members of the programming art room, the programming Art series will be worse than what is presented to everyone now (at least I personally think so ), without the correction and improvement of many netizens and friends, the programming Art series will be even more inadequate, thus losing its own lasting motivation and tomorrow. Therefore, I am very grateful to all the enthusiastic friends for their guidance and opinions on the programming Art series. Your feedback has helped us a lot in our creation.CommunityRecommended for editing. Thank you very much. Finally, I urge the readers to continue to supervise the programming Art series and criticize and correct it at any time (we cannot leave any bug ). This is because the programming Art series may end with Chapter 60th. Thank you.

OK. Here are the first 10 chapters of the programming Art series that have been written. There are 13 articles in total. I hope you can feel the programming skills and fun (click the link to open it ):

• Selfless sharing for the benefit of the world
  • Chapter 1: Left-rotated string
  • Chapter 2: String inclusion
  • Chapter 3: finding the minimum k Number
  • Chapter 3 continued: Implementation of top K algorithm problems
  • Chapter 3 continued: in-depth analysis and implementation of quick select Algorithm
  • 3. Continue and find the K small (large) element in the given subscript range in the array.
  • Chapter 4: Compile functions similar to strstr/strcpy/strpbrk
  • Chapter 5: Finding two or more matching conditions
  • Chapter 6. Solving affinity numbers less than 5 million
  • Chapter 7: finding the largest sum of continuous subarrays
  • Chapter 8. Starting from the beginning to the end
  • Chapter 9 catch-up with gossip linked lists
  • Chapter 10: how to sort disk files with 10 ^ 7 data volumes

There are still many problems and deficiencies in the last ten chapters of the programming Art series,Permanent errata and permanent Optimization. If you have any questions, suggestions, or problems, errors, vulnerabilities, and bugs in any of the above chapters of the programming Art Series, please feel free to give us feedback in time, we will be grateful. Of course, if you are interested, we also welcome you to join us-programming art room:

1. Strong programming skills,
2. Have a certain amount of spare time
3. The longer the work experience, the better (the more competent graduate students or ACM personnel can also consider)
4. Willing to share project experience or performance optimization suggestions at work
5. Algorithm lovers are preferred.

If you meet the above requirements, you are welcome to join the programming art room. Interested, can contact me at any time (zhoulei0907@yahoo.cn), to create more value, better service for everyone. Thank you.

All rights reserved. infringement is required. It is strictly prohibited to be used for any commercial purposes. Violators are permanently held legally liable.