• Choose a category
• All
• Classic-Fiction

interface for, Interface for Minimum Spanning Trees

Prim's algorithm, Prim's Algorithm, Implementation and Analysis of Minimum Spanning Trees, Questions and Answers

minimum-weight paths, Description of Shortest Paths (see shortest paths)

mobile computing, Data Compression

modexp function, rsa_encipher

modular arithmetic, Related Topics

modularity of code, A Bit About Software Engineering

mst function, mst, Implementation and Analysis of Minimum Spanning Trees

MstVertex structure, Description

Muller's method, Related Topics

multigraphs, Related Topics

multilists, Related Topics

multiplication method (hashing), Multiplication method

multiset, Questions and Answers

N

national security, Data Encryption

nearest-neighbor heuristic, Applying the Nearest-Neighbor Heuristic

networking problems, Graph Example: Counting Network Hops

Newton form of a polynomial, Description of Polynomial Interpolation

Newton formula for interpolating polynomials, Constructing an Interpolating Polynomial

next_token function, Chained Hash Table Example: Symbol Tables

notations (algorithm analysis), O-Notation, Analysis Example: Insertion Sort, Related Topics, Related Topics, Related Topics, Related Topics, Related Topics

O-notation, O-Notation, Analysis Example: Insertion Sort, Related Topics

o-notation, Related Topics

w-notation, Related Topics

Θ-notation, Related Topics

Ω-notation, Related Topics

NP-complete problems, Related Topics, Description of the Traveling-Salesman Problem

numerical analysis, Numerical Methods

numerical methods, Numerical Methods, Numerical Methods

O

O-notation, O-Notation, Simple Rules for O-Notation, O-Notation Example and Why It Works, Analysis Example: Insertion Sort, Questions and Answers

examples of, O-Notation Example and Why It Works

simple rules for, Simple Rules for O-Notation

o-notation, Related Topics

object-oriented languages, Implementation and Analysis of Stacks

OFB (Output Feedback), Related Topics

OHTbl structure, Implementation and Analysisof Open Addressed Hash Tables

ohtbl_destroy, Return Value, ohtbl_destroy, ohtbl_size

ohtbl_init, Return Value, ohtbl_init, ohtbl_size

ohtbl_insert, Return Value, ohtbl_insert, ohtbl_size

ohtbl_lookup, Return Value, ohtbl_lookup, ohtbl_size

ohtbl_remove, Return Value, ohtbl_remove, ohtbl_size

ohtbl_size, Return Value, ohtbl_size

open-addressed hash tables, Hash Tables, Description of Open-Addressed Hash Tables, Description of Open-Addressed Hash Tables, Collision Resolution, Collision Resolution, Collision Resolution, Collision Resolution, Collision Resolution, Linear probing, Double hashing, Return Value, Return Value, Return Value, Return Value, Return Value, Return Value, Return Value, Implementation and Analysisof Open Addressed Hash Tables, ohtbl_init, ohtbl_destroy, ohtbl_insert, ohtbl_insert, ohtbl_remove, ohtbl_lookup, ohtbl_size, Related Topics

auxiliary hash functions, Collision Resolution

collision resolution, Collision Resolution

description of, Description of Open-Addressed Hash Tables

destroy, Return Value, ohtbl_destroy

double hashing, Double hashing

implementation and analysis of, Implementation and Analysisof Open Addressed Hash Tables

initialize, Return Value, ohtbl_init

insert element, Return Value, ohtbl_insert

interface for, Return Value

load factor, Collision Resolution

lookup element, Return Value, ohtbl_lookup

primary clustering, Linear probing

probing, Collision Resolution

remove element, Return Value, ohtbl_remove

secondary clustering, Related Topics

size of, Return Value, ohtbl_size

uniform hashing, Collision Resolution

vacated element, ohtbl_insert

operations on data structures, An Introduction to Data Structures

operators (expression trees), Binary Tree Example: Expression Processing

optimized networking, Data Compression

order of growth, O-Notation

order statistics, Sorting and Searching

orientation of points, Computer Test for Intersecting Line Segments, Questions and Answers

P

P-box permutation, Enciphering and Deciphering