CSE 373 Lecture Notes - Lecture 8: Insertion Sort, Selection Sort, Merge Sort

54 views3 pages

17 May 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

CSE 373 Lecture 8

Insertion Sort:

- Worst case runtime O(n2)

- Best case runtime O(n)

- Average runtime O(n2)

- Stable? Yes

- In-place? Yes

Selection Sort:

- Loop through end to find next smallest item

- Worst case runtime O(n2)

- Best case runtime O(n2)

- Average runtime O(n2)

Unlock document

This preview shows page 1 of the document.
Unlock all 3 pages and 3 million more documents.

Already have an account? Log in

Get access