How to Apply Algorithmic Design and Data Structure Techniques in Developing Structured Programs
An algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Output. Algorithms are generally created independent of underlying languages, i.e., an algorithm can be implemented in more than one programming language. From the data structure point of view, the following are some important categories of algorithms. Search − Algorithm to search an item in a data structure. Sort − Algorithm to sort items in a certain order. Insert − Algorithm to insert an item in a data structure. Update − Algorithm to update an existing item in a data structure. Delete − Algorithm to delete an existing item from a data structure. Characteristics of an Algorithm Not all procedures can be called an algorithm. Algorithm. An algorithm should have the following characteristics. – Unambiguous − The algorithm Algorithm should be clear and unambiguous. Unambiguous. Each step (or phase) and th...