AlgorithmsPreview. Arithmetic. Random numbers. Polynomials. Gaussian Elimination. Curve fitting. Integration. Elementary sorting methods. Quicksort. Radix sorting. Priority Queues. Selection and merging. External sorting. Elementary searching methods. Balanced trees. Hashing. Radix searching. External searching. String searching. Pattern matching. Parsing. File compression. Cryptology. Elementary geometric methods. Finding the convex hull. Range searching. Geometric intersection. Closest point problems. Elementary graph algorithms. Connectivity. Weighted graphs. Directed graphs. Network flow. Matching. Algorithm machines. The fast fourier transform. Dynamic programming. Linear programming. Exhaustive search. NP-complete problems. |
Other editions - View all
Common terms and phrases
adjacency adjacency list algorithm applications array begin binary search trees binary tree bits character coefficients complicated consider convex hull corresponding data structure delete depth-first search described diagram disk edges efficient element eliminate encoding equal keys equations examine example external node fundamental Gaussian elimination geometric given grammar graph heap implementation input insertion sort integer intersection involved large number linear linked list machine match mathematical matrix merge mergesort minimum spanning tree multiplication operations output parser partitioning Pascal path pattern performance point set pointer polygon polynomial position priority queue problem procedure Quicksort radix sort random number records with keys rectangle recursive call regular expression representation represented root running scan search key searching methods sequence sequential simple solution solve sorting method spline subfiles subtree tape technique text string variables vertex vertices Write a program