Register

OpenDSA Stand-alone Modules

| About Contents

Index

A | B | C | D | E | F | G | H | I | K | L | M | P | Q | R | S | T | U | V

A

agile methods
Alonzo Church

alpha
alpha-conversion

B

binding occurrence
Binsort
bnf grammar

BNF grammar

double recursion and ambiguity

Bubble Sort

C

Carl Friedrich Gauss
collision resolution

comparable

D

data structure

selecting

E

estimation

exchange sorting

F

free
function abstraction

functional programming

lambda calculus

G

Gauss

H

hashing
hashing function

Heapsort
Huffman

I

Insertion Sort, [1]

inversion

K

key, [1]

L

lambda abstraction

lambda calculus

BNF grammar
anonymous function
function abstraction
function application
lambda abstraction
parentheses
syntax
variable

least squares regression
logarithm

M

Mergesort

P

perfect hashing
pivot
plan-driven methods

process

software development

by contradiction
by induction
direct

Q

Quicksort

R

Radix Sort

record comparison

searching
sorting

S

search key, [1]

searching

record comparison

Selection Sort, [1]

increment

sorting

empirical comparison
exchange
lower bounds proof
record comparison

T

todo

U

unified modeling langauage

selecting, [1]

V

variable capture

variable scope

Contact Us || Privacy | | License Contents