# note01 - Outline 1 Algorithm Analysis 2 Growth rate...

This preview shows pages 1–10. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Outline 1 Algorithm Analysis 2 Growth rate functions 3 The properties of growth rate functions: 4 Importance of the growth rate 5 An example 6 Encryption c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 1 / 29 Algorithm Analysis It means: estimating the recourses required. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. The efficiency of an algorithm is measured by a runtime function T ( n ) . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. The efficiency of an algorithm is measured by a runtime function T ( n ) . n is the size of the input. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. The efficiency of an algorithm is measured by a runtime function T ( n ) . n is the size of the input. Strictly speaking, n is the # of bits needed to represent input. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. The efficiency of an algorithm is measured by a runtime function T ( n ) . n is the size of the input. Strictly speaking, n is the # of bits needed to represent input. Commonly, n is the # of items in the input, if each item is of fixed size . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 29 Algorithm Analysis It means: estimating the recourses required. The resources of algorithms: time and space . We mainly consider time: harder to estimate; often more critical. The efficiency of an algorithm is measured by a runtime function T ( n ) ....
View Full Document

{[ snackBarMessage ]}

### Page1 / 99

note01 - Outline 1 Algorithm Analysis 2 Growth rate...

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

View Full Document
Ask a homework question - tutors are online