T÷lvunarfrŠ­i 2

═slensk-enskur or­alisti

Vinsamlegast lßti­ mig vita ef ■a­ vantar ■ř­ingar ß einhverjum or­um.
a­fer­ ßn ˙tfŠrslu
pure virtual method

afritssmi­ur
copy constructor

bakskeytisvirki
postfix operator

bi­r÷­
queue

bˇlur÷­un
bubble sort

eftirr÷­un
postorder

eftirtßknunarform
postfix form

endurkvŠmni
recursion

erf­ir
inheritance

fastbundin a­fer­
static bound method

fj÷lnota klasi/fall
template class/function

fleytitala
floating point number

forgangsbi­r÷­
priority queue

forr÷­un
preorder

forskeytisvirki
prefix operator

fortßknunarform
prefix form

gagnagrind
data structure

hakkatafla
hash table

halaendurkvŠmni
tail recursion

haushn˙tur
head node

helmingunarleit
binary search

hle­slustu­ull (alpha)
load factor

hn˙tur
node

hˇpun (Ý h÷kkun)
clustering

hringtengdur listi
circular list

hr˙ga
heap

huglŠg gagnat÷g
abstract data types (ADT)

hŠkkunarruna
increment sequence

h÷kkun
hashing

innr÷­un
inorder

innsetningarr÷­un
insertion sort

inntßknunarform
infix form

lagr÷­un
level-order

lausbundin a­fer­
virtual method (e­a dynamic bound method)

lykill
key

minnisleki
memory leak

net
graph

opin h÷kkun
open addressing

ˇbreytanleg tilvÝsun
const-reference

reiknirit
algorithm

runuleit
sequential search

ruslas÷fnun
garbage collection

skipting
partition

slembitala
random number

sta­vŠr breyta
local variable

stafli (hla­i)
stack

stef
routine (void function)

stika
edge

stŠr­argrß­a
big-Oh

st÷­ug r÷­unara­fer­
stable sorting

tßknatafla
symbol table

tengdur listi
linked list

tilvÝsun
reference

tvÝtengdur listi
doubly linked list

tvÝundartrÚ
binary tree

tv÷f÷ld h÷kkun
double hashing

˙tfŠrsla
implementation

valr÷­un
selection sort

var­stak
sentinel

vendistak
partition element, pivot

vÝsir
index

yfirhle­sla falla
function overloading

yfirhle­sla virkja
operator overloading


hh (hja) hi.is, jan˙ar, 2003.