CS223-0124-Master

# CS223-0124-Master - CS223 Advanced Data Structures and...

This preview shows pages 1–6. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS223 Advanced Data Structures and Algorithms 1 Sorting and Master Method Sorting and Master Method Neil Tang Neil Tang 01/24/2008 01/24/2008 CS223 Advanced Data Structures and Algorithms 2 Class Overview Class Overview Review of sorting algorithms: Insertion, merge and quick The master method CS223 Advanced Data Structures and Algorithms 3 Insertion Sort Insertion Sort Start from the second element and select an element (key) in each step. Insert the key to the current sorted subsequence such that the new subsequence is in the sorted order. The time complexity is Θ (N 2 ) CS223 Advanced Data Structures and Algorithms 4 Insertion Sort Insertion Sort 3 5 2 8 5 j i key 3 3 5 2 8 2 j i key 3 2 3 5 8 3 2 3 5 8 8 j i key 3 2 3 5 8 3 j i key 3 2 3 3 5 8 CS223 Advanced Data Structures and Algorithms 5 Merge Sort Merge Sort Divide: Divide the N-element sequence into 2 subsequences of N/2 each....
View Full Document

## This note was uploaded on 04/17/2008 for the course CS 223 taught by Professor Tang during the Spring '07 term at MSU Bozeman.

### Page1 / 14

CS223-0124-Master - CS223 Advanced Data Structures and...

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

View Full Document
Ask a homework question - tutors are online