The best way to begin solving which algorithms and data structures you should use in your structured programs are to understand that there is no one-size-fits-all. By understanding the common algorithms and data structures and their strengths and weaknesses, you are well on your way to becoming a better programmer. In the following paragraphs, we will dive into some key definitions and concepts for implementation in your structured programs.
Data Structures
When developing a program, the programmer should start with
studying data structures and then the algorithms that manipulate them. The way
information is structured in a program has varying effects on its processing
efficiency. That said, what is a data structure? A data structure is a representation
of how data is organized so that it can be used efficiently (Lysecky, R.,
Vahid, Lysecky, S., & Givargis, 2015). Data structures can solve various
problems, including searching data, processor speeds, and handling multiple
requests (Shaffer, 2013). For example, a sorted list of integers stored in an
array is one form of structuring. Some others are linked lists, hash tables,
stacks, queues, graphs, and trees.
