How to apply algorithmic design & data structure techniques in developing structure programs?
How to apply algorithmic design & data structure techniques in developing structure programs? An algorithm is a step-by-step procedure that defines instructions to be executed in a specific order to get the desired output. Algorithms are generally created independent of underlying languages; 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 particular 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. Are some algorithms and data structure designs better than others? Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer, a bit string