×
BE SO GOOD THEY CAN'T IGNORE YOU
--Your friends at LectureNotes
Close

Note for Design And Analysis Of Algorithm - DAA By sindu devi

  • Design And Analysis Of Algorithm - DAA
  • Note
  • Anna University -
  • Computer Science Engineering
  • 10 Views
  • Uploaded 3 months ago
Sindu Devi
Sindu Devi
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-2

What is an algorithm? An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time. problem algorithm input Copyright © 2007 Pearson Addison-Wesley. All rights reserved. “computer” output A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2nd ed., Ch. 1 1-1

Text from page-3

Algorithm An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time. • Can be represented various forms • Unambiguity/clearness • Effectiveness • Finiteness/termination • Correctness Copyright © 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2nd ed., Ch. 1 1-2

Text from page-4

Historical Perspective Euclid’s algorithm for finding the greatest common divisor Muhammad ibn Musa al-Khwarizmi – 9th century mathematician www.lib.virginia.edu/science/parshall/khwariz.html Copyright © 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2nd ed., Ch. 1 1-3

Text from page-5

Notion of algorithm and problem problem algorithm input (or instance) “computer” output algorithmic solution (different from a conventional solution) Copyright © 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2nd ed., Ch. 1 1-4

Lecture Notes