Introduction to Algorithms: A Creative ApproachThis book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. 0201120372B04062001 |
From inside the book
Results 1-3 of 54
Page 67
... node has a key , which comes from a totally ordered set ( for example , a real number or an integer ) . We will interchangeably refer to the key and the node as the same when no confusion can arise . For convenience , we assume that we ...
... node has a key , which comes from a totally ordered set ( for example , a real number or an integer ) . We will interchangeably refer to the key and the node as the same when no confusion can arise . For convenience , we assume that we ...
Page 72
... node ( a pointer to the node containing the key x , or nil if no such node exists ) . begin if root = nil or root ^ .key = x then node : = root { root is the record that the pointer root is pointing to . } else if x < root key then ...
... node ( a pointer to the node containing the key x , or nil if no such node exists ) . begin if root = nil or root ^ .key = x then node : = root { root is the record that the pointer root is pointing to . } else if x < root key then ...
Page 74
... node with the key x , if it exists . { We assume that the root is never deleted , and that all keys are distinct } begin end node : = root ; while node nil and node ^ .key # x do parent : = node ; if x < node ^ .key then node : = node ^ .
... node with the key x , if it exists . { We assume that the root is never deleted , and that all keys are distinct } begin end node : = root ; while node nil and node ^ .key # x do parent : = node ; if x < node ^ .key then node : = node ^ .
Contents
Introduction | 1 |
Data Structures | 4 |
Mathematical Induction | 9 |
Copyright | |
15 other sections not shown
Common terms and phrases
algorithm to find arbitrary array assume augmenting path AVL tree begin end biconnected components binary search Boolean chapter clique problem colors compute Consider constant contains convex hull corresponding cycle data structure defined delete Design an algorithm DFS numbers efficient algorithm elements example Exercise Figure given in Fig graph G Gray code heap implies induction hypothesis input insert integer intersection length Let G lower bound matching matrix multiplication maximal maximum MCST mergesort minimal natural numbers node NP-complete number of comparisons number of edges O(n log Output parallel algorithms pointer points polygon polynomial possible processors proof prove quicksort recurrence relation reduction remove requires root running Section sequence shortest paths simple solution solve sorting spanning tree step straightforward Strassen's algorithm string strongly connected strongly connected component subgraph subproblems subset subtree techniques theorem total number undirected graph variables vertex cover weighted