discrete mathematics i chapter 11 dr. adam anthony spring 2011 some material adapted from lecture...
TRANSCRIPT
![Page 1: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/1.jpg)
DISCRETE MATHEMATICS I CHAPTER 11Dr. Adam Anthony
Spring 2011
Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco
![Page 2: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/2.jpg)
2
Algorithms
What is an algorithm?
An algorithm is a finite set of precise instructions for performing a computation or for solving a problem.
This is a rather vague definition. You will get to know a more precise and mathematically useful definition when you attend CS430.
But this one is good enough for now…
![Page 3: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/3.jpg)
3
Algorithms
Properties of algorithms: Input from a specified set, Output from a specified set (solution), Definiteness of every step in the computation, Correctness of output for every possible input, Finiteness of the number of calculation steps, Effectiveness of each calculation step and Generality for a class of problems.
![Page 4: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/4.jpg)
4
Algorithm Examples
We will use a pseudocode to specify algorithms, which slightly reminds us of Basic and Pascal.
Example: an algorithm that finds the maximum element in a finite sequenceprocedure max(a1, a2, …, an: integers)
max := a1for i := 2 to n
if max < ai then max := ai{max is the largest element}
![Page 5: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/5.jpg)
5
Algorithm Examples
Another example: a linear search algorithm, that is, an algorithm that linearly searches a sequence for a particular element.
procedure linear_search(x: integer; a1, a2, …, an: integers)i := 1while (i n and x ai)
i := i + 1if i n then location := ielse location := 0{location is the subscript of the term that equals x, or is
zero if x is not found}
![Page 6: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/6.jpg)
6
Algorithm Examples
If the terms in a sequence are ordered, a binary search algorithm is more efficient than linear search.
The binary search algorithm iteratively restricts the relevant search interval until it closes in on the position of the element to be located.
![Page 7: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/7.jpg)
7
Algorithm Examples
a c d f g h j l m o p r s u v x z
binary search for the letter ‘j’
center element
search interval
![Page 8: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/8.jpg)
8
Algorithm Examples
a c d f g h j l m o p r s u v x z
binary search for the letter ‘j’
center element
search interval
![Page 9: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/9.jpg)
9
Algorithm Examples
a c d f g h j l m o p r s u v x z
binary search for the letter ‘j’
center element
search interval
![Page 10: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/10.jpg)
10
Algorithm Examples
a c d f g h j l m o p r s u v x z
binary search for the letter ‘j’
center element
search interval
![Page 11: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/11.jpg)
11
Algorithm Examples
a c d f g h j l m o p r s u v x z
binary search for the letter ‘j’
center element
search interval
found !
![Page 12: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/12.jpg)
12
Algorithm Examples
procedure binary_search(x: integer; a1, a2, …, an: integers)i := 1 {i is left endpoint of search interval}j := n {j is right endpoint of search interval} while (i < j)begin
m := (i + j)/2if x > am then i := m + 1else j := m
endif x = ai then location := ielse location := 0{location is the subscript of the term that equals x, or is zero if
x is not found}
![Page 13: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/13.jpg)
13
Complexity
In general, we are not so much interested in the time and space complexity for small inputs.
For example, while the difference in time complexity between linear and binary search is meaningless for a sequence with n = 10, it is gigantic for n = 230.
![Page 14: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/14.jpg)
14
Measuring Complexity
An algorithm’s cost can be measured in terms of the number of ‘steps’ it takes to complete the work
A step is anything that takes a fixed amount of time, regardless of the input size Arithmetic operations Comparisons If/Then statements Print Statements Etc.
Some steps in reality take longer than others, but for our analysis we will see that this doesn’t matter that much
![Page 15: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/15.jpg)
15
Complexity Functions
The number of ‘steps’ needed to execute an algorithm often depends on the size of the input: Linear_Search([1,25,33,47],33) ~ 3 ‘steps’ Linear_Search([1,16,19,21,28,33,64,72,81], 33) ~
6 ‘steps’ We’ll instead express the complexity of an
algorithm as a function of the size of the input N.T(N) = N (for linear search)T(N) = N2 (for other algorithms we’ll see)
![Page 16: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/16.jpg)
16
Example 1
Suppose an algorithm A requires 103n2 steps to process an input of size n. By what factor will the number of steps increase if the input size is doubled to 2n?
Answer the same question for Algorithm B which requires 2n3 steps for input size n.
Answer the same question for both, but now increase the input size to 10n.
![Page 17: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/17.jpg)
17
Complexity
For example, let us assume two algorithms A and B that solve the same class of problems, both of which have an input size of n: The time complexity of A is T(A) = 5,000n, The time complexity of B is T(B) = 1.1n
![Page 18: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/18.jpg)
18
Complexity
Comparison: time complexity of algorithms A and B
Algorithm A Algorithm BInput Size
n
10
100
1,000
1,000,000
5,000n
50,000
500,000
5,000,000
5109
1.1n3
2.51041
13,781
4.81041392
![Page 19: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/19.jpg)
19
Complexity
This means that algorithm B cannot be used for large inputs, while running algorithm A is still feasible.
So what is important is the growth of the complexity functions.
The growth of time and space complexity with increasing input size n is a suitable measure for the comparison of algorithms.
![Page 20: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/20.jpg)
20
But wait, there’s more!
Consider the following functions:
The n2 term dominates the rest of f(n)! Algorithm analysis typically involves finding
out which term ‘dominates’ the algorithm’s complexity
n f(N) = n2 + 4n + 20
g(n) = n2
10 160 100
50 2,720 2,500
100 10,420 10,000
1000 1,004,020 1,000,000
10,000 100,040,020 100,000,000
![Page 21: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/21.jpg)
21
Big-Oh
Definition: Let f and g be functions from the integers or the real numbers to the real numbers.
We say that f(x) is O(g(x)) if there are constants B and b such that:
|f(x)| B|g(x)|whenever x > b.
In a sense, we are saying that f(x) is never greater than g(x), barring a constant factor
![Page 22: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/22.jpg)
22
Graphical Example
![Page 23: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/23.jpg)
23
The Growth of Functions
When we analyze the growth of complexity functions, f(x) and g(x) are always positive.
Therefore, we can simplify the big-O requirement to
f(x) Bg(x) whenever x > b.
If we want to show that f(x) is O(g(x)), we only need to find one pair (C, k) (which is never unique).
![Page 24: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/24.jpg)
24
The Growth of Functions
The idea behind the big-O notation is to establish an upper boundary for the growth of a function f(x) for large x.
This boundary is specified by a function g(x) that is usually much simpler than f(x).
We accept the constant B in the requirement f(x) Bg(x) whenever x > b, because B does not grow with x. We are only interested in large x, so it is OK if
f(x) > Bg(x) for x b.
![Page 25: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/25.jpg)
25
The Growth of Functions
Example:Show that f(x) = x2 + 2x + 1 is O(x2).
For x > 1 we have:x2 + 2x + 1 x2 + 2x2 + x2
x2 + 2x + 1 4x2
Therefore, for B = 4 and b = 1:f(x) Bx2 whenever x > b.
f(x) is O(x2).
![Page 26: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/26.jpg)
26
The Growth of Functions
Question: If f(x) is O(x2), is it also O(x3)?
Yes. x3 grows faster than x2, so x3 grows also faster than f(x).
Therefore, we always have to find the smallest simple function g(x) for which f(x) is O(g(x)).
![Page 27: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/27.jpg)
27
A Tighter Bound
Big-O complexity is important because it tells us about the worst-case
But there’s a best-case too! Incorporating a lower bound, we get big-
Theta notation: f(x) is (g(x)) if there exist constants A, B, b
such that A|g(x)| f(x) B|g(x)| for all real
numbers x > b In a sense, we are saying that f and g
grow at exactly the same pace, barring constant factors
![Page 28: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/28.jpg)
28
Graphical Example
![Page 29: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/29.jpg)
29
A useful observation
Given two functions f(x) and g(x), let f(x) be O(g(x)) and g(x) be O(f(x)). Then f(x) is (g(x)) and g(x) is (f(x)).
Work out on board.
![Page 30: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/30.jpg)
30
Exercise 1
Let f(x) = 2x + 1 and g(x) = x Show that f(x) is (g(x)).
![Page 31: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/31.jpg)
31
Useful Rules for Big-O
If x > 1, then 1 < x < x2 < x3 < x4 < …
If f1(x) is O(g1(x)) and f2(x) is O(g2(x)), then (f1 + f2)(x) is O(max(g1(x), g2(x)))
If f1(x) is O(g(x)) and f2(x) is O(g(x)), then(f1 + f2)(x) is O(g(x)).
If f1(x) is O(g1(x)) and f2(x) is O(g2(x)), then (f1f2)(x) is O(g1(x) g2(x)).
![Page 32: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/32.jpg)
32
Exercise 2
Let f(x) = 7x4 + 3x3 + 5 and g(x) = x4 for x ≥ 0
Prove that f(x) is O(g(x)).
![Page 33: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/33.jpg)
33
Exercise 3
Prove that 2n3 - 6n is O(n3).
Prove that 3n4 – 4n2 + 7n – 2 is O(n4)
![Page 34: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/34.jpg)
34
Exercise 4
Let f(n) = n(n-1)/2 and g(n) = n2 for n ≥ 0. Prove that f(n) is O(g(n)).
![Page 35: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/35.jpg)
35
Polynomial Order Theorem
For any polynomial f(x) = anxn + an-
1xn-1 + … + a0, where a0, a1, …, an are non-zero real numbers,
f(x) is O(xn)f(x) is Θ(xn)
![Page 36: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/36.jpg)
36
Some useful summation formulas
1 2 3 ... n n(n 1)
2
12 22 32 ... n2 n(n 1)(2n 1)
6
13 23 33 ... n3 n(n 1)
2
2
1 r r2 ... rn rn1 1
r 1 for r1.
![Page 37: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/37.jpg)
37
Exercise 5
Use the polynomial order theorem to show that 1 + 2 + 3 + … + n is Θ(n2).
![Page 38: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/38.jpg)
38
The Growth of Functions
In practice, f(n) is the function we are analyzing and g(n) is the function that summarizes the growth of f(n)
“Popular” functions g(n) are: n log n, 1, 2n, n2, n!, n, n3, log n
Listed from slowest to fastest growth:• 1• log n• n• n log n• n2
• n3
• 2n
• n!
![Page 39: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/39.jpg)
39
The Growth of Functions
A problem that can be solved with polynomial worst-case complexity is called tractable.
Problems of higher complexity are called intractable.
Problems that no algorithm can solve are called unsolvable.
You will find out more about this in CSC 430.
![Page 40: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/40.jpg)
40
Analyzing a real algorithm
What does the following algorithm compute?procedure who_knows(a1, a2, …, an: integers)
m := 0for i := 1 to n-1
for j := i + 1 to nif |ai – aj| > m then m := |ai – aj|
{m is the maximum difference between any two numbers in the input sequence}
Comparisons: n-1 + n-2 + n-3 + … + 1 = (n – 1)n/2 = 0.5n2 – 0.5n
Time complexity is O(n2).
![Page 41: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/41.jpg)
41
Complexity Examples
Another algorithm solving the same problem:
procedure max_diff(a1, a2, …, an: integers)min := a1max := a1for i := 2 to n
if ai < min then min := ai
else if ai > max then max := ai
m := max - minComparisons: 2n - 2
Time complexity is O(n).
![Page 42: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/42.jpg)
42
Logarithmic Orders
Logarithmic algorithms are highly desirable because logarithms grow slowly with respect to n
There are two classes that come up frequently: log n n*log n
The base is usually unimportant (why?) but if you must have one, 2 is a safe bet.
![Page 43: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/43.jpg)
43
Exercise 6
Prove that log(x) is O(x) Prove that x is O(x*log(x)) Prove that x*log(x) is O(x2).
![Page 44: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/44.jpg)
44
Exercise 7
Prove that 10x + 5x*log(x) is Θ(x*log(x))
![Page 45: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/45.jpg)
45
Exercise 8
Prove that ⎣log(n)⎦ is Θ(log(n))
![Page 46: DISCRETE MATHEMATICS I CHAPTER 11 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam Lomonaco](https://reader036.vdocuments.us/reader036/viewer/2022062718/56649e7c5503460f94b7def2/html5/thumbnails/46.jpg)
46
Binary Representation of Integers Let f(n) = the number of binary digits
needed to represent n, for a positive integer n. Find f(n) and its order.
How many binary digits are needed to represent 325,561?