• Choose a category
• All
• Classic-Fiction

example of, Arc Length Example: Approximating Distances on Earth

formula, Computing the Length of an Arc

geodist function, Arc Length Example: Approximating Distances on Earth

great-circle distances, Arc Length Example: Approximating Distances on Earth

implementation and analysis of, Implementation and Analysis of Arc Length on Spherical Surfaces

interface for, Interface for Arc Length on Spherical Surfaces, Description

rectilinear coordinate system, Rectilinear and Spherical Coordinates

spherical coordinate system, Rectilinear and Spherical Coordinates, Arc Length Example: Approximating Distances on Earth

using latitude and longitude, Arc Length Example: Approximating Distances on Earth

arcs, Description of Graphs

archiving, Data Compression

arclen function, arclen, Implementation and Analysis of Arc Length on Spherical Surfaces

arithmetic coding, Related Topics

arithmetic with large integers, Related Topics

arrays, Arrays, Arrays, Arrays, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing, Questions and Answers, Hash Tables, Hash Tables, Description of Heaps

as pointers, Arrays

associative, Hash Tables

bounds information, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing

in hash tables, Hash Tables

in heaps[arrays, Description of Heaps

heaps}, Description of Heaps

vs. linked lists, Questions and Answers

multi-dimensional, Arrays

passed to functions, Call-by-Reference Parameter Passing, Call-by-Reference Parameter Passing

articulation points, Description of Graphs, Questions and Answers

artificial intelligence, Trees

associative arrays, Hash Tables

asymmetric ciphers, Data Encryption (see public-key ciphers)

authentication servers, Data Encryption

automatic variables, Storage Allocation

avalanche effect, Enciphering and Deciphering Data Blocks

average-case performance, Reasons for Worst-Case Analysis

AVL (Adelson-Velskii and Landis) trees, Implementation and Analysis of Binary Search Trees

AvlNode structure, RL rotation

B

B-trees, Trees, Questions and Answers, Questions and Answers, Related Topics, Related Topics, Related Topics, Related Topics

balance factor, Implementation and Analysis of Binary Search Trees

balanced trees, Tree Balancing

Bellman-Ford algorithm, Related Topics

best-case analysis, Worst-Case Analysis

best-fit lines, Numerical Methods, Description of Least-Squares Estimation

bfs function, Graph Example: Counting Network Hops

BfsVertex structure, Graph Example: Counting Network Hops, Graph Example: Counting Network Hops

biconnected components, Description of Graphs

biconnected graphs, Description of Graphs

binary search, Sorting and Searching, Sorting and Searching, Description of Binary Search, Description of Binary Search, Interface for Binary Search, Implementation and Analysis of Binary Search, Binary Search Example: Spell Checking

description of, Description of Binary Search

example of, Binary Search Example: Spell Checking

implementation and analysis of, Implementation and Analysis of Binary Search

interface for, Interface for Binary Search

binary search trees, Trees, Trees, Description of Binary Search Trees, Description of Binary Search Trees, Description of Binary Search Trees, Description of Binary Search Trees, Interface for Binary Search Trees, Return Value, Return Value, Return Value, Return Value, Description, Return Value, Implementation and Analysis of Binary Search Trees, Implementation and Analysis of Binary Search Trees, Implementation and Analysis of Binary Search Trees, Rotations in AVL Trees, bistree_init, bistree_destroy, bistree_insert, bistree_insert, bistree_remove, bistree_remove, Questions and Answers, Questions and Answers, Questions and Answers, Questions and Answers, Questions and Answers, Related Topics

AVL trees, Implementation and Analysis of Binary Search Trees

balancing,