14_review

14_review - CS161 - Course Review David Kauchak Sorting...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS161 - Course Review David Kauchak Sorting algorithms Algorithms * Mergesort * Insertion sort * Selection sort * Bubblesort * Quicksort (randomized quicksort) * Heapsort algorithm features (in place, stable, etc)ps2 how they operate runtimes Runtime, how they operate Big O O , Θ, Ω Proving bounds Proving bounds don’t hold Comparing functions (rules of thumb) Recurrences Recursion-tree method Substitution method Master method Search trees 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Binary search trees B-trees Operations and runtime Data structures Linked lists Stacks Queues Binary heaps Priority queues Operations, how they operate and runtime Hashtables Hash functions Collision by chaining Open addressing * Linear probing * Quadratic probing * Double hashing Operations, how they operate, collision analysis, runtime Graph algorithms Types of graphs (directed, undirected, weighted, trees, dags, com- plete, bipartite, . ..) Representations (adjacency list, adjacency matrix)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 05/25/2011.

Page1 / 5

14_review - CS161 - Course Review David Kauchak Sorting...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online