Sorting Lecture

Sorting
APS105: Computer Fundamentals Jason Anderson

Dept. of Electrical and Computer Engineering Faculty of Applied Science and Engineering University of Toronto
Sorting
Phonebook useless if names were not in alphabetical (sorted) order
Why Sorting?
Sorting used in many computer programs:
iPod sorts songs based on title or artist. Facebook sorts friends in alphabetical order. Facebook gives you the most-recent status. Excel spreadsheet can sort column by values. Online dating: sort dating matches based on how close by they live. Youtube sorts based on popularity. .
3
Sorting Objective
Given: list of items (numbers, names, etc). Want to put the items sorted order.
Alpha order Largest-to-smallest Smallest-to-largest Darkest colour to lightest colour
Sometimes there are so many items, we need computers help to do the sorting!
What is an Algorithm?
Set of steps for completing a task. You have already been designing algorithms in this class. You already use algorithms all the time in your daily life!
Algorithm for Baking a Cake

Cream the butter. Mix the dry ingredients separately. Combine the dry and wet ingredients. Mix until smooth. Put into baking pan. Bake for 30 mins at 350 F. Is cake done?
If yes, remove from oven. If no, bake for another 5 minutes.
6
Algorithm Efficiency
Washer, dryer take 30 mins each. Have one load of light clothes, one load dark clothes.
Algorithm 1: 2 pm : Light clothes into washer 2:30 pm: Light clothes into dryer 3 pm: Darks into washer 3:30 pm: Darks into dryer Algorithm 2: 2 pm: Light clothes into washer 2:30 pm: Light clothes into dryer AND Darks into washer 3 pm: Darks into dryer
All done at 4 pm!
All done at 3:30 pm!
Sorting Algorithms
Sequence of steps computer takes for getting items into the right (sorted) order. Many different sorting algorithms invented:
But they have different efficiencies!
Some take more steps to get things into the right order. Some work better for different types of items.
Want fast sorting algorithms:

Sort GTA phonebook with 6 million names.
8
Sorting Algorithms
Research on sorting algorithms:
Started in 1950s Still active today (new algorithm invented in 2004)!
Well discuss three classic sorting approaches today:

Bubble sort Insertion sort Quicksort
9
Bubble Sort
Walk through the list of numbers, comparing two items at a time.
Swap the two items if theyre out of order.
The biggest item bubbles up to the top. Walk the list of numbers several times until completely sorted!
10
Bubble Sort
Sort Children from Shortest to Tallest
11
Bubble Sort
Look at first two children and swap them, if necessary.
12
Bubble Sort
Look at NEXT two children and swap them, if necessary.
13
Bubble Sort
14
Bubble Sort
15
Bubble Sort
16
Bubble Sort
Look at LAST two children and swap them, if necessary.
17
Bubble Sort
Look at LAST two children and swap them, if necessary.
18
Bubble Sort
Look at FIRST two children and swap them, if necessary.
19
Bubble Sort
20
Bubble Sort
21
Bubble Sort
22
Bubble Sort
23
Bubble Sort
We dont need to look at the last TWO, as in each pass the biggest bubbles up to the top spot.
24
Bubble Sort
25
Bubble Sort
26
Bubble Sort
We dont need to look at these TWO, as in each pass the biggest bubbles up to the top spot.
27
Bubble Sort
We dont need to look at these TWO, as in each pass the biggest bubbles up to the top spot.
Since we didnt make ANY swaps in this pass, 28 were DONE!
Bubble Sort
How many comparisons? Sort 1000 items:
1st pass: 999 comparisons/swaps 2nd pass: 998 comparisons/swaps 999th pass: 1 comparison/swap
Sort n items:
(n-1)*(n-2)/2 comparison/swaps
29
Insertion Sort
Like sorting playing cards in hand:
Draw a first card card is sorted. Draw second card compare with first card. Draw third card compare with two cards. Draw nth card compare with n-1 cards.
Can speed-up using property that hand is kept sorted.

30
Quicksort
Invented in 1962 by C. Hoare. Much more efficient than previous algorithms.
Fewer steps needed to get items into order.
Still widely used today. Uses recursion.
31
Recursion
Contains smaller version of same picture
32
Recursion in Computing
Task is broken down into smaller/easier tasks solved in a similar way.
Ends when we hit a BASE/END case.
33
Recursion in Computing
Task is broken down into smaller/easier tasks solved in a similar way.
Ends when we hit a BASE/END case. Invest $1000 at 8% interest. How much do I have in 3 years?
Cash(3 years) = Cash(2 years) + 8% x Cash(2 years) Cash(2 years) = Cash(1 years) + 8% x Cash(1 years) Cash(1 year) = Cash(0 years) + 8% x Cash(0 years) Cash(0 years) = $1000.00
Cash(3 years) = $1259.71!

34
Quicksort Core Action

Want to sort 10 cards:
6 3 9 0 2 1 7 4 5 8
Choose a pivot card:
35

Walk along the cards and partition the cards into two groups:
Cards smaller than the pivot. Cards larger than the pivot.
7 6
Left partition Left partition is all less than 6, but is still unsorted!
Right partition Pivot card is where it should be!
36

Now take the left partition & repeat action!
4 3 5 0 4 2 1
Pivot is in its correct place
Partition the left partition:

37
2 4

Likewise, take the right partition and repeat the process.
8 9 7 8
Partition the right partition:

38
8 9
Quicksort Overview
Pivot and partition the left and right half.
39
Quicksort Overview
40
Quicksort Overview
41
Quicksort Overview
42
Quicksort Overview
43
Quicksort Overview
Continue until the pieces are so small there is nothing to do! SORTED
44
Nitty Gritty Details

How do we do the partitioning?
6 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
Consider two arrows LOW and HIGH.
45

6 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
Consider two arrows LOW and HIGH. HIGH will march LEFT until it finds a number less than PIVOT.
46

6 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
Consider two arrows LOW and HIGH. HIGH marches LEFT until it finds a number less than PIVOT.
47

6 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
The number at HIGH is moved to the position LOW.

48

5 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
The number at HIGH is moved to the position LOW.

49

5 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
LOW marches RIGHT until it finds a number greater than PIVOT

50

5 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
LOW marches RIGHT until it finds a number greater than PIVOT

51

5 3 9 0 2 1 7 4 6 5 8
LOW
HIGH
The number at position LOW is moved to position HIGH.

52

5 3 9 0 2 1 7 4 6 9 8
LOW
HIGH

53

5 3 9 0 2 1 7 4 6 9 8
LOW
HIGH
HIGH marches left until it finds a number less than PIVOT.

54

5 3 9 0 2 1 7 4 6 9 8
LOW
HIGH
HIGH marches left until it finds a number less than PIVOT.

55

5 3 9 0 2 1 7 4 6 9 8
LOW
HIGH
The number at position HIGH is moved to position LOW.

56

5 3 4 0 2 1 7 4 6 9 8
LOW
HIGH
The number at position HIGH is moved to position LOW.

57

5 3 4 0 2 1 7 4 6 9 8
LOW
HIGH
LOW marches right until it finds a number larger than PIVOT.

58

5 3 4 0 2 1 7 4 6 9 8
LOW
HIGH
LOW marches right until it finds a number larger than PIVOT.

59

5 3 4 0 2 1 7 4 6 9 8
LOW
HIGH

60

5 3 4 0 2 1 7 7 6 9 8
LOW
HIGH

61

5 3 4 0 2 1 7 7 6 9 8
LOW
HIGH
HIGH marches LEFT until it aligns with LOW.

62

5 3 4 0 2 1 7 7 6 9 8
LOW HIGH
HIGH marches LEFT until it aligns with LOW.

63

5 3 4 0 2 1 7 7 6 9 8
LOW HIGH
The PIVOT is inserted at the position LOW/HIGH.

64

5 3 4 0 2 1 6 7 7 6 9 8
LOW HIGH

65

5 3 4 0

66
AR P
TIO TI
IN N
C G
1
MP O 7 6 7
E! ET L
6 9 8
LOW HIGH
Quicksort
How many comparisons/swaps?
Sort 1000 items:
1000 items
67
Quicksort
Sort 1000 items:
1000 items ~500 items ~500 items
68
Quicksort
Sort 1000 items:
1000 items ~500 items ~250 items ~250 items ~500 items ~250 items ~250 items
69
Quicksort
Sort 1000 items: ~10 levels of the tree
1000 items ~500 items ~250 items ~250 items ~500 items ~250 items ~250 items
~1 item ~1 item ~1 item ~1 item
.....
.....
.....
.....
.....
.....
.....
~1 item ~1 item
.....
70
Comparing Algorithms
To sort 1000 times:
Quicksort requires ~10,000 comparisons (on average). Bubble sort may require ~500,000 comparisons. Insertion sort may require ~500,000 comparisons.
71
Sorting Summary
Sorting: key part of many computer programs!! Algorithm: set of steps for completing a task. Different algorithms for same task may have different efficiencies! Talked about three sorting algorithms:
Bubble sort, Insertion Sort and Quicksort
Bubble sort and insertion sort are simple to build, but need many steps to sort the list. Quicksort is more complex to build, sorts list much faster.
72

Sorting Lecture

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Sorting Lecture

Загружено:

Авторское право:

Доступные форматы

Sorting

APS105: Computer Fundamentals Jason Anderson

Algorithm for Baking a Cake

All done at 4 pm!

All done at 3:30 pm!

Want fast sorting algorithms:

Well discuss three classic sorting approaches today:

Look at first two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at LAST two children and swap them, if necessary.

Look at LAST two children and swap them, if necessary.

Look at FIRST two children and swap them, if necessary.

Look at FIRST two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Look at FIRST two children and swap them, if necessary.

Look at NEXT two children and swap them, if necessary.

Since we didnt make ANY swaps in this pass, 28 were DONE!

Can speed-up using property that hand is kept sorted.

Still widely used today. Uses recursion.

Contains smaller version of same picture

Cash(3 years) = $1259.71!

Quicksort Core Action

Choose a pivot card:

Quicksort Core Action

Right partition Pivot card is where it should be!

Quicksort Core Action

Choose a pivot card:

Pivot is in its correct place

Partition the left partition:

Quicksort Core Action

Choose a pivot card:

Partition the right partition:

Nitty Gritty Details

Consider two arrows LOW and HIGH.

Nitty Gritty Details

Nitty Gritty Details

Nitty Gritty Details

The number at HIGH is moved to the position LOW.

Nitty Gritty Details

The number at HIGH is moved to the position LOW.

Nitty Gritty Details

LOW marches RIGHT until it finds a number greater than PIVOT

Nitty Gritty Details

LOW marches RIGHT until it finds a number greater than PIVOT

Nitty Gritty Details

The number at position LOW is moved to position HIGH.

Nitty Gritty Details

The number at position LOW is moved to position HIGH.

Nitty Gritty Details

HIGH marches left until it finds a number less than PIVOT.

Nitty Gritty Details

HIGH marches left until it finds a number less than PIVOT.

Nitty Gritty Details

The number at position HIGH is moved to position LOW.

Nitty Gritty Details

The number at position HIGH is moved to position LOW.

Nitty Gritty Details

LOW marches right until it finds a number larger than PIVOT.