Computer Science: An OverviewComputer Science: An Overview truly lives up to its title, providing a timely introduction to the entire computer science discipline. Broad coverage, combined with clear explanations, has made it the leading textbook for the breadth-first course. This book provides a balanced, realistic picture that communicates the dynamics of computer science by presenting topics in a historical perspective in which past developments, the current state of the art, and directions of research are discussed. The coverage of topics such as programming languages, operating systems, algorithms, software engineering, networking, database design, artificial intelligence, and machine architecture result in a complete overview of the field of computer science. |
From inside the book
Results 1-3 of 54
... sort as presented in Figure 5.11 was applied to the list Gene , Cheryl , Alice , and Brenda . Describe the ... sort algorithm is the selection sort . It begins by selecting the smallest entry in the list and moving it to the front . It ...
... sort to sort a variety of lists of length 10 , we expect the average number of comparisons per sort to be 22.5 . The significance of these results is that the number of comparisons made during the execution of the insertion sort ...
... sort these pieces , and then merges these sorted pieces together to obtain the final sorted version of the list . To analyze the complexity of this algorithm , we first consider the number of com- parisons between list entries that must ...