Algorithmic Design and Data Structure Techniques
A lgorithmic Design and Data Structure Techniques An algorithm is a way to solve a problem as efficiently and simplistically as possible. Algorithms can be classified as follows: Design Method Implementation Method Classification by Design Method: There are primarily three main categories into which an algorithm can be named in this type of classification. They are: Greedy Method Divide and Conquer Dynamic Programming Linear Programming Reduction(Transform and Conquer) Classification by Implementation Method: There are primarily three main categories into which an algorithm can be named in this type of classification. They are: Recursion or Iteration Exact or Approximate Serial or Parallel or Distributed Algorithms The following are the common data structures: List: Single linked list, double linked list Queue: FIFO queue, priority queue Stack: LIFO queue Tree Array Different algorithms can be used to solve different kinds of problems. As a newbie you will likely gravitate toward