Scribd
Upload
8 views

Lecture 3

This document discusses algorithms and data structures including searching, sorting, and recursion. It covers common algorithms like linear search, binary search, selection sort, bubble sort, and merge sort. It also discusses Big O notation and analyzing time complexity of algorithms.

Uploaded by

Lucas Scommegna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Lecture 3

This document discusses algorithms and data structures including searching, sorting, and recursion. It covers common algorithms like linear search, binary search, selection sort, bubble sort, and merge sort. It also discusses Big O notation and analyzing time complexity of algorithms.

Uploaded by

Lucas Scommegna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 110

This is CS50

help50

style50

check50

printf

debug50

ddb
help50

style50

check50

printf

debug50

ddb
searching
input → → output
→ → output
→ → bool
algorithms
running times
O
time to solve

size of problem
O(n) O(n/2)

time to solve

O(log2n)

size of problem
O(n) O(n/2)

time to solve

O(log2n)

size of problem
O(n) O(n)

time to solve

O(log2n)

size of problem
O(n) O(n)

time to solve

O(log n)

size of problem
O(n)

time to solve

O(log n)

size of problem
O(n2)

O(n log n)

O(n)

O(log n)

O(1)
Ω
Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1)
linear search
For i from 0 to n-1
If number behind i'th door
Return true
Return false
O(n2)

O(n log n)

O(n)

O(log n)

O(1)
O(n2)

O(n log n)

O(n) linear search

O(log n)

O(1)
Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1)
Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search


binary search
If number behind middle door
Return true
Else if number < middle door
Search left half
Else if number > middle door
Search right half
If no doors

If number behind middle door


Return true
Else if number < middle door
Search left half
Else if number > middle door
Search right half
If no doors
Return false
If number behind middle door
Return true
Else if number < middle door
Search left half
Else if number > middle door
Search right half
O(n2)

O(n log n)

O(n) linear search

O(log n)

O(1)
O(n2)

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search


Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search, binary search


int numbers[]
string names[]
data structures
person people[]
string name;
string number;
typedef struct
{
string name;
string number;
}
person;
sorting
input → → output
unsorted → → output
unsorted → → sorted
6 3 8 5 2 7 4 1 → → sorted
6 3 8 5 2 7 4 1 → → 1 2 3 4 5 6 7 8
selection sort
6 3 8 5 2 7 4 1
For i from 0 to n-1
Find smallest item between i'th item and last item
Swap smallest item with i'th item
n
n + (n – 1)
n + (n – 1) + (n – 2)
n + (n – 1) + (n – 2) + ... + 1
n + (n – 1) + (n – 2) + ... + 1

n(n + 1)/2
n + (n – 1) + (n – 2) + ... + 1

n(n + 1)/2

(n2 + n)/2
n + (n – 1) + (n – 2) + ... + 1

n(n + 1)/2

(n2 + n)/2

n2/2 + n/2
n + (n – 1) + (n – 2) + ... + 1

n(n + 1)/2

(n2 + n)/2

n2/2 + n/2

O(n2)
O(n2)

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
O(n2) selection sort

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
For i from 0 to n-1
Find smallest item between i'th item and last item
Swap smallest item with i'th item
Ω(n2)

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search, binary search


Ω(n2) selection sort

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search, binary search


bubble sort
6 3 8 5 2 7 4 1
Repeat until sorted
For i from 0 to n-2
If i'th and i+1'th elements out of order
Swap them
Repeat n-1 times
For i from 0 to n-2
If i'th and i+1'th elements out of order
Swap them
(n – 1) × (n – 1)
(n – 1) × (n – 1)

n2 – 1n – 1n + 1
(n – 1) × (n – 1)

n2 – 1n – 1n + 1

n2 – 2n + 1
(n – 1) × (n – 1)

n2 – 1n – 1n + 1

n2 – 2n + 1

O(n2)
O(n2) selection sort

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
O(n2) selection sort, bubble sort

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
Repeat n-1 times
For i from 0 to n-2
If i'th and i+1'th elements out of order
Swap them
If no swaps
Quit
Ω(n2) selection sort

Ω(n log n)

Ω(n)

Ω(log n)

Ω(1) linear search, binary search


Ω(n2) selection sort

Ω(n log n)

Ω(n) bubble sort

Ω(log n)

Ω(1) linear search, binary search


recursion
1 Pick up phone book
2 Open to middle of phone book
3 Look at page
4 If person is on page
5 Call person
6 Else if person is earlier in book
7 Open to middle of left half of book
8 Go back to line 3
9 Else if person is later in book
10 Open to middle of right half of book
11 Go back to line 3
12 Else
13 Quit
1 Pick up phone book
2 Open to middle of phone book
3 Look at page
4 If person is on page
5 Call person
6 Else if person is earlier in book
7 Open to middle of left half of book
8 Go back to line 3
9 Else if person is later in book
10 Open to middle of right half of book
11 Go back to line 3
12 Else
13 Quit
1 Pick up phone book
2 Open to middle of phone book
3 Look at page
4 If person is on page
5 Call person
6 Else if person is earlier in book
7 Open to middle of left half of book
8 Go back to line 3
9 Else if person is later in book
10 Open to middle of right half of book
11 Go back to line 3
12 Else
13 Quit
1 Pick up phone book
2 Open to middle of phone book
3 Look at page
4 If person is on page
5 Call person
6 Else if person is earlier in book
7 Search left half of book
8
9 Else if person is later in book
10 Search right half of book
11
12 Else
13 Quit
1 Pick up phone book
2 Open to middle of phone book
3 Look at page
4 If person is on page
5 Call person
6 Else if person is earlier in book
7 Search left half of book
8 Else if person is later in book
9 Search right half of book
10 Else
11 Quit
merge sort
Sort left half of numbers
Sort right half of numbers
Merge sorted halves
If only one number
Quit
Else
Sort left half of numbers
Sort right half of numbers
Merge sorted halves
If only one number
Quit
Else
Sort left half of numbers
Sort right half of numbers
Merge sorted halves
3 5 6 8 1 2 4 7
If only one number
Quit
Else
Sort left half of numbers
Sort right half of numbers
Merge sorted halves
O(n2) selection sort, bubble sort

O(n log n)

O(n) linear search

O(log n) binary search

O(1)
O(n2) selection sort, bubble sort

O(n log n) merge sort

O(n) linear search

O(log n) binary search

O(1)
Ω(n2) selection sort

Ω(n log n)

Ω(n) bubble sort

Ω(log n)

Ω(1) linear search, binary search


Ω(n2) selection sort

Ω(n log n) merge sort

Ω(n) bubble sort

Ω(log n)

Ω(1) linear search, binary search


θ
Θ(n2)

Θ(n log n)

Θ(n)

Θ(log n)

Θ(1)
Θ(n2) selection sort

Θ(n log n) merge sort

Θ(n)

Θ(log n)

Θ(1)
This is CS50

You might also like