Data Structures and Algorithms

Data Structure is a systematic way to organize data in order to use it efficiently. Hence, anything that can store data can be called as a data structure. Data structure types are determined by what types of operations are required or what kinds of algorithms are going to be applied.

The two main types of data structures are; Primitive Data Structures which includes Integer, Float, Boolean, Character etc. Abstract Data Structures are complex Data Structures, which are used to store large and connected data. Some example of are: Linked List, tree, graph, stack, queue etc.

Algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. In other words, it is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithm is not the complete code or program, it is just the core logic (solution) of a problem, which can be expressed either as an informal high level description as pseudocode or using a flowchart.