Compared with the various gossip about physics, the computer field seems much more calm. (Of course, this may be because I have little knowledge.) So I recorded some of the gossip about computer Daniel that I found by chance, and I will update it later.
1. K & R of the C programming language is called the C Bible. I believe that anyone who learns computer should know this book. This R is Dennis Ritchie, one of the inventors of Unix. In 1983, he won the Nobel Prize in computer science, er, and Turing. He died two years ago. It is said that because of a person living in the house, the specific death event was unknown to everyone. His friends visited him and found out that he had an accident... This K seems to be a little famous, but I later found that it is also very promising. His full name is Brian kernighan, and K, a well-known language on the Linux platform awk. (By The Way, A is Alfred Aho, the author of The longbook about the compiler. It seems that cool people like to play together .)
2. The Floyd-warshall algorithm is used to calculate the shortest distance between all vertices in the graph. It is independently discovered by the two people in the same year. Floyd is Robert Floyd, who won the Turing Award in 1978. When he was in college, his first degree was liberal arts, his second degree was physics, and he later switched to computer science. He has trained a total of seven doctoral students, one of whom is Robert Tarjan, the author of the well-known LCA algorithm at O (1) time, and won the Turing Award in 1986. Another famous algorithm of Floyd is to judge whether a linked list has a ring. (two pointers are used to move one step at a time and the other two steps at a time .) Floyd "genealogy" http://infolab.stanford.edu/pub/voy/museum/floydtree.html on the Internet
3. There is a well-known data structure textbook named data structures and algorithm analysis in C, written by Mark Weiss. His teacher is Robert Sedgewick, A knuth student and author of a well-known algorithm book. Dr. Weiss seems to be doing shell sorting, so his book has a detailed proof of shell sorting. There are also many questions about the upper and lower limits of shell sorting in subsequent exercises, general books do not seem to have. At that time, it was particularly annoying to see this place.
4. The author of Tex is knuth, which we all know. However, latex authors cannot answer this question. His name is Leslie Lamport and he won the Turing Award in 2013. Of course, he won the prize not by latex, but by his contribution to distributed computing systems.
Total number of computers