Algorithm & Data Structures

  

An algorithm is a set of instructions executed in a specific order to get a particular output. Many programming languages use different algorithms and can be implemented in many ways; some important categories are search, sort, insert, update, and delete. Search is to look for a specific item in a data structure. Sort is putting items in a particular order; Insert is when something needs to go into the structure. An update is to update an existing item in the data structure, and a delete is to delete a current object.

Others will best use each data structure. It typically depends on the user and the capability of their computer how to store data. There are different ways to execute a code. For example, array and record data are based on arithmetic operations, while linked data structure store addressed data items within the system. Data structures require a certain amount of space for what they will store and time performance for the operation.

Algorithmic design and data structures are efficient tools for building different operations on data, such as arrays, trees, linked lists, stacks, graphs, and more. Each programming language uses some algorithm and structure to work. When developing structured programs, it’s vital to learn how to build a program where everything works amongst each other.

 

Reference

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

Data structures and algorithms — CS2 software design & data structures. (n.d.). OpenDSA. https://opendsa-server.cs.vt.edu/ODSA/Books/CS2/html/IntroDSA.html