lec15-complexity - Complexity of algorithms, Page 3 15.3...

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

View Full Document Right Arrow Icon
EECS 203, Winter 2007 Discrete Mathematics Lecture 15 Complexity of algorithms February 22 Reading: Rosen [3.3] February 22 Complexity of algorithms, Page 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
15.1 Complexity measures How to measure the running time of an algorithm? Examples: linear search, Bubble sort, insertion sort, merge February 22 Complexity of algorithms, Page 2
Background image of page 2
15.2 Recursive algorithms Examples: binary search, merge sort. February 22
Background image of page 3

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

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

Unformatted text preview: Complexity of algorithms, Page 3 15.3 Complexity classes P: the class of decision problems having a polynomial time algorithm. NP: the class of decision problems whose positive instance can be veried in polynomial time. Example of an NP problem: Clique. NP-complete problems: in NP and hardest in NP. Is P=NP? February 22 Complexity of algorithms, Page 4...
View Full Document

Page1 / 4

lec15-complexity - Complexity of algorithms, Page 3 15.3...

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