Other Classification

1. Classification by Research Area 

In computer science each field has its own problems and needs efficient algorithms. Examples: search algorithms, parallel algorithms, data compression algorithms, parsing techniques, and more.

1. Classification by Complexity 

In this classification, algorithms are classified by the time they take to find a solution based on their input size. Some algorithms take linear time complexity (O( n)) and others take exponential time, and some never halt.

1. Classification by Complexity 

In this classification, algorithms are classified by the time they take to find a solution based on their input size. Some algorithms take linear time complexity (O( n)) and others take exponential time, and some never halt.

1. Branch and Bound Enumeration and Backtracking 

These were used in Artificial Intelligence and we do not need to explore these fully. For the Backtracking method refer to the Recursion and Backtracking chapter.