Are some algorithms and data structure designs better than others?

The data structure is how data is organized and stored in memory, whereas algorithms solve a problem like a search or a sort with that data. Some algorithms and data structures are better depending on the complexity of both data structure and algorithms. “The complexity of an algorithm is the cost, measured in running time, or storage, or whatever units are relevant, of using the algorithm to solve one of the problems” (Wilf, 2002, p. 1).  

How would you apply algorithmic design and data structure techniques to develop structured programs?

First, the data structure needs to be defined to understand what algorithms can be used. Here is a list of the available data structures and types of data they can use.


Once the proper data structure has been selected for the input and analyzed data, algorithms can be selected or designed to solve the problem. These algorithms can be examined for complexity using equations like the big ‘O’, Omega, and Theta that help calculate the upper and lower bounds of an algorithm’s growth rate.

 

 

Reference:

Lysecky, R., Vahid, F., Lysecky, S., & Givargis, T. (2015). Data structures essentials. zyBooks.

Wilf, H. S. (2002). Algorithms and complexity. [electronic resource] (2nd ed.). A.K. Peters.