19 - Growth of Introduction Functions Discrete Mathematics...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction Growth of Functions Discrete Mathematics Andrei Bulatov
Background image of page 1

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

View Full DocumentRight Arrow Icon
Discrete Mathematics – Growth of Functions 19-2 Complexity of Algorithms How to measure what the efficiency of an algorithm is? Sorting algorithms: given a sequence of numbers, arrange it in the increasing order. Longer sequences require more time. The (time) complexity of a sorting algorithm is a function f such that processing a sequence of length n requires f(n) seconds. Not good: - computers are different, so, f(n) is ill-defined - different sequences of the same length may require different time The (worst case) (time) complexity of a sorting algorithm is a function f such that processing a sequence of length n requires at most f(n) steps.
Background image of page 2
19-3 Comparing Algorithms There are more than 20 different sorting algorithms. Which one is the best? Consider two of them: bubble sort and merge sort. We use the same computer, so we can measure in seconds, rather than in steps. n
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/14/2011 for the course MACM 101 taught by Professor Pearce during the Spring '08 term at Simon Fraser.

Page1 / 11

19 - Growth of Introduction Functions Discrete Mathematics...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online