How To Apply Algorithmic Design and Data Structure Techniques in Developing Structured Programs

      Data structures are the way a program is able to retrieve and store data. For instance when using Python, data is stored in dictionaries. To access and store data in Java, arrays and objects can be used. When developing structured programs, many different data structures and algorithmic designs can be used.  Each data structure you use when developing a program will have it’s own algorithm for sorting data, inserting data, finding data, ect. Some algorithms on the other hand can only be used with specific data structures, while others cannot be used with certain data structures. In order to have create the most efficient structure, you must determine which algorithm is most suitable for that specific data structure in order to optimize the data structure. With that being said, each data structure has its own pros and cons. It is rare to have a data structure that is better for use than another structure in all situations. If this were the case, the inferior data structure would eventually be forgotten and replaced by the superior data structure. Some general examples of data structures include queue, stack, tree, linked lists, ect. Depending on the needed use of the program, as well as the developers preference, will determine which data structure can be used for each situation, as they are not universal algorithms.