×
Time can be your best friend and your worst enemy depending on whether you use it or waste it.
--Your friends at LectureNotes
Close

Analysis and Design of Algorithms

by Amindian
Type: NoteCourse: B.Tech Specialization: Computer Science EngineeringDownloads: 1Views: 24Uploaded: 1 month agoAdd to Favourite

Download PDF
0 User(s)

Share it with your friends

Suggested Materials

Leave your Comments

Contributors

Types of Algorithms
Algorithm classification ◼ ◼ ◼ ◼ Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification scheme for algorithms This classification scheme is neither exhaustive nor disjoint The purpose is not to be able to classify an algorithm as one type or another, but to highlight the various ways in which a problem can be attacked 2
A short list of categories ◼ Algorithm types we will consider include: ◼ ◼ ◼ ◼ ◼ ◼ ◼ ◼ Simple recursive algorithms Backtracking algorithms Divide and conquer algorithms Dynamic programming algorithms Greedy algorithms Branch and bound algorithms Brute force algorithms Randomized algorithms 3
Simple recursive algorithms I ◼ A simple recursive algorithm: ◼ ◼ ◼ ◼ Solves the base cases directly Recurs with a simpler subproblem Does some extra work to convert the solution to the simpler subproblem into a solution to the given problem I call these “simple” because several of the other algorithm types are inherently recursive 4

Lecture Notes