Review Topics

Review Topics - Review Topics Algorithm analysis (O, , , o,...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Review Topics ¾ Algorithm analysis ( O, , Θ , o , proofs) ¾ Lists, stacks and queues ¾ Trees (binary, expression, binary search, AVL, B-trees) ¾ Hashing (hashing table, hashing functions, open hashing -separate chaining, closed hashing -open addressing: [linear probing, quadratic probing, double hashing], rehashing ) ¾ Sorting (bubble sort, insertion sort, shell sort, merge sort, quick sort,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/28/2010 for the course CSC CSC1110 taught by Professor Cjyuan during the Fall '06 term at CUHK.

Ask a homework question - tutors are online