Data structure is about structuring or arranging and storing of data in such a way so that it can be accessed and used efficiently.

This defines the relationship between data and the operations that can be performed on the data.*Â *

In this tutorial, we will be discussing Data Structures and Algorithms. As we know Data Structure is an essential and important topic to learn, therefore we have tried to keep this article as basic as we could.

So let us dive into in detail.

*The main idea behind Data structure is toÂ *

*reduces the memory usage of a Data Structure operation i.e., space complexity*

- reduces the execution time of operations on Data Structure i.e., theÂ
*time complexity*

*Data structures and algorithms that we will see later in this blog are concepts that are independent of language. Therefore once we master it in any one language, itâ€™s relatively easy to switch to another one, though it differs in the built-in methods and APIs for different languages.*

*Therefore, the data structures and algorithm as concepts are the same across languages, the implementation, however, varies greatly.*

For Example, the most common use of Data Structure is a Dictionary, where all the words are arranged in alphabetical order that is, in a sorted manner which makes the searching of words to find its meaning, very easy.

We have two types of Data Structures:

- Linear Data Structure
- Non-Linear Data Structure

**Linear Data Structure**

A data structure is said to be linear if the elements are arranged in a linear and sequential order.

Data items can be traversed in a single run. The implementation of this type of Data structure is easy.

Common Examples of Linear Data Structure are:

- Arrays
- Queues
- Stacks
- Linked lists

**Non-Linear Data Structure**

A data structure is said to be non-linear if the elements are arranged in a non â€“ sequential order.

Data cannot be traversed in a single run and also the implementation is difficult.

Examples of Non-linear Data Structure are:

- Trees
- Graphs

**Why do we need Data Structure?**

- Allows easier processing of data.
- Data Structures are important for designing efficient algorithms.
- Secure way of storing data.
- We can access data anytime and anywhere.

**Execution Time Cases**

There are three cases which are used to compare Data Structureâ€™s execution time:

**Worst Case:Â**The scenario where a specific Data structure operations take the maximum time it can take.

**Best Case:Â**The scenario that takes the least execution time to perform a Data Structureâ€™s operation.

**Average Case:Â**This is the scenario that depicts the average execution time of the operation of a Data Structure.

**Algorithm**

An important aspect to Data Structures are the Algorithms as Data structures are implemented using Algorithms. It is generally described that Data Structure + Algorithm = Programs.

An algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

Algorithms can be implemented in more than one programming language.

A data structure is a systematic way of organizing and accessing data, and an algorithm is a step-by-step procedure for performing some task in a finite amount of time.

**Operations performed on Data Structure**

There are various operations performed on Data Structures. Few of them are listed as:

**Sorting:Â**Â arranging the data elements of a data structure in a specific order is called sorting**Searching:Â**searching for a particular element in a data structure is called searching**Merging:Â**Â combining elements of two similar data structure to form a new data structure of the same type is called merging**Insertion:Â**Inserting or adding a new element to a data structure**Deletion:Â**removal of an element from a data structure if present is called deletion**Traversal:Â**processing all the elements present in a data structure is called Traversing

**Asymptotic NotationsÂ **

Before writing a program we create a blueprint in the form of Algorithms that serves as a flowchart depicting the steps according to which we could implement the program.

There could be various approaches to solve a particular problem, we can call these approaches as algorithms.

Among these approaches, we choose the best algorithm based on its time and space complexity.

To represent these complexities Asymptotic Notations are used. These are expressions that allow us to analyze an algorithmâ€™s time and space complexities by identifying its behavior as the input size(n) for the algorithm increases. This is also known as Algorithmâ€™s Growth Rate.

Using Asymptotic Notation we can very well conclude the Best Case, Average Case and Worst-Case scenario of an algorithm.

**Types of Asymptotic Notations**

There are commonly three types of Asymptotic Notation used for calculating the running time complexity of an algorithm.

**Big Oh(O) Notation â†’Â**it is the asymptotic notation for theÂ**worst case**Â for a given expression and is represented byÂ**O**. It gives us an asymptoticÂ**upper bound**Â for the growth rate of the runtime of an algorithm.

It measures the maximum amount of time an algorithm can take to complete its operation.

Common Big O notations:

**O(1):**Â The big O notation O(1) represents the complexity of an algorithm whose execution time is constant or same for operations regardless of the input data.**O(n):Â Â**The big O notation O(n) represents the complexity of an algorithm whose performance is directly proportional (grows linearly) to the size of the input data.**O(n^2):Â**Â The big O notation O(n^2) represents the complexity of an algorithm is directly proportional to the square of the size of the input data.**O(log n):Â**The big O notation O(log n) basically means time goes up linearly while â€˜nâ€™Â goes up exponentially.

2.Â **Omega Notation â†’Â **it is the asymptotic notation for theÂ **best case**Â for a given expression and is represented by the symbolÂ **Î©.Â **It expresses theÂ **lower bound**Â of an algorithmâ€™s running time.

In other words, if we represent the time complexity of an algorithm in the form ofÂ **Î©,Â **it means that the algorithm will at least take this much time to complete its execution, it can take more than this too.

3.Â **Theta Notation â†’Â **it is the asymptotic notation, which is represented by the symbolÂ **Î˜.Â **Â This is used to denote the asymptotically tight bound that is both the upper and the lower bound of an algorithmâ€™s running time.

The theta notationÂ **Î˜**Â represents the average running time that lies between the best and the worst cases.

**Sorting techniques**

The sorting operation mentioned above can be done in many ways. These various sorting techniques are analyzed for the best, worst and the average.

As we know sorting refers to arranging data in a particular format.

These sorting techniques are:

**Bubble sort:**Â this is the simplest of sorting techniques. This is a comparison based algorithm, in which for a given array, each element compares with the adjacent element in the array and the elements are swapped if not in order.

Bubble sort hasÂ **worst-case**Â complexity:**Â O(n ^{2}) and best caseÂ **complexity

**: Î©(n)**

where n is the number of elements being sorted.

Let us see the working of the Bubble sort:

Bubble sorting starts from the first element present at the 0th index, compares it with the adjacent element to check which one is greater and swaps to keep it in ascending order and the process continues.

Letâ€™s say we have an array with 5 elements

15 | 6 | 22 | 90 | 10 |

In this case, sorting starts from the first two elements, compares themselves, here 15 is greater than 6, therefore the two element gets swapped.

6 | 15 | 22 | 90 | 10 |

Now the second element compares itself with the third since they are in sorted order already, no swapping is done.

6 | 15 | 22 | 90 | 10 |

Next, we compare the next two values, that is, 22 and 90, since they are in sorted order, no swapping is done.

6 | 15 | 22 | 90 | 10 |

Then we move on to the last two elements, compare the two values and swap if needed.

After the first iteration the sorting looks like this:

6 | 15 | 22 | 10 | 90 |

After the second iteration it looks like this:

6 | 15 | 10 | 22 | 90 |

After the third iteration it looks like this:

6 | 10 | 15 | 22 | 90 |

And when no swapping is required, the array is completely sorted and bubble sorting is done.

**Selection sort:Â**in this sorting algorithm the first element of the array is selected and is compared with all the other elements in the array. If any other element in the array is less than the first element, then swapping of those two elements takes place.

Selection sort hasÂ **worst-caseÂ **complexity**: O(n ^{2})**Â

**and best caseÂ**complexity:

**Â Î©(n**

^{2})Let us see the working of selection sort:

Taking the same array of elements as above

15 | 6 | 22 | 90 | 10 |

We select the first element that is, 15 and compares it with the rest of the element. Here we found 6 to be the lowest value and hence swaps the two elements.

6 | 15 | 22 | 90 | 10 |

After the first iteration, the minimum value in the array that is 6 appears to be in the first position

6 | 15 | 22 | 90 | 10 |

For the second iteration, the second element 15 is selected and is compared to the rest of the elements in the list, 10 is found to be the least and hence the two get swapped. The array looks like this

6 | 10 | 22 | 90 | 15 |

The same process continues and after the third iteration the array looks like this

6 | 10 | 15 | 90 | 22 |

After the fourth iteration, the array looks like this and is finally in the sorted order.

6 | 10 | 15 | 22 | 90 |

**Insertion sort:Â**Â It is another comparison based sorting algorithm. Insertion sorting starts from index 1 that is the key. This key element is compared to the elements to its left.

If the key element is less than the element at the left, we swap the two and if the key element is greater than the element at the left we left it as it is.

Then we make the element at index 2 as the key and compare the element at its left and do the swapping accordingly until it gets sorted and repeats the same procedure until the array is sorted.

Insertion sort hasÂ **worst-caseÂ **complexity**: O(n ^{2})**Â

**and best caseÂ**complexity

**: Î©(n)**

Let us take an array with 4 elements as below:

7 | 4 | 5 | 2 |

We make the element at index 1 that is, 4 as the key and compares it with the value at the left. Since 4 is less than 7 hence the two gets swapped.

4 | 7 | 5 | 2 |

Element at the 2nd index that is 5 is the key now. Comparing it with the values at the left that is 7, since 7 is greater than 5 and 4 is less than 5, so no change in position of 4 and 5 will be moved to the position of 7.

4 | 5 | 7 | 2 |

The last element that is 2 is the key now. Comparing it with all the elements at the left we found all the elements are greater than 2, so all the elements will move forward and 2 will be shifted to position of 4.

2 | 4 | 5 | 7 |

Hence the above array results in the final sorted array.

**Merge sort:Â**this is the sorting technique that is based on divide and conquer algorithm. In this algorithm, sorting is done by first dividing the array into equal halves and then combining it in a sorted manner.

Merge sort hasÂ **worst-caseÂ **complexity:**Â O(n log(n))**Â **and best caseÂ **complexity**: Î©(n log(n))**

Let us see the working of this algorithm.

We take an unsorted array of length 8 as follows:

77 | 41 | 65 | 33 | 22 | 10 | 4 | 60 |

We will divide the array into two equal halves, which will make two arrays with 4 elements each.

77 | 41 | 65 | 33 |

22 | 10 | 4 | 60 |

Now we will further divide the two arrays into their respective halves

77 | 41 |

65 | 33 |

22 | 10 |

4 | 60 |

We will further divide it until it can no more be divided and we get the atomic values

77 |

41 |

65 |

33 |

22 |

10 |

4 |

60 |

Since they are completely broken down into atomic values, we will now combine them in exactly the same manner as they were divided

While combining we will first compare the two elements being combined and sort them. Therefore while combining the elements 77Â and 41 since 77 is greater hence we swap the two elements.

Likewise while combining 65 and 33, since 65 is greater we swap the two. Similarly, 22 and 10 are swapped whereas 4 and 60 remain as it is. Hence the combined array looks as below.

41 | 77 |

33 | 65 |

10 | 22 |

4 | 60 |

Now in the second iteration, we will compare lists of two data values, and merge them into an array of 4 each

33 | 41 | 65 | 77 |

4 | 10 | 22 | 60 |

And after final merging, the list looks like this

4 | 10 | 22 | 33 | 41 | 60 | 65 | 77 |

**Quicksort:Â**It is a recursive sorting method that keeps calling itself. It is based on divide and conquer algorithm and is efficient for large data sets.

In this, an element is selected as a Pivot value and two subarrays are created one for storing values less than the pivot value and other for storing values larger than the pivot value.

The main question arises here is which element to be picked up as pivot. The value of pivot is generally chosen based on some logic and implementation. There are four possibilities:

- Selecting first element of the list as the pivot
- Selecting last element of the list as the pivot
- Selecting a random element as pivot
- Selecting median as the pivot

However we prefer to choose the last element of the list as Pivot.

Quicksort hasÂ **worst-caseÂ **complexity**: O(n ^{2})**Â

**and best caseÂ**complexity

**: Î©(n log(n))**

Let us see the working of the same.

We have an array with element as follows.

29 | 60 | 44 | 19 | 30 | 59 | 57 |

Here we will take theÂ **last element(70) as Pivot**. Now we have to do partitioning of the array in such a way such that the pivot comes to its correct position in a sorted array and all the elements smaller than the pivot comes to the left side of the pivot and elements larger than the pivot comes to the right side of the pivot. This method is also known as Partitioning. We will continue to do this until we get the sorted list.

We will take two variables**Â i and j**, i will be used to calculate the final position of the pivot and j is used to iterate through the array.Â **Â Low**Â is the starting index andÂ **high**Â is the ending index(the index of pivot).

Initially,Â **i and j are initialized to low-1 and low**Â respectively.

It will start by comparing each value of j with the pivot. j is in the range from low to high.

If arr[j] <= pivot

i++

arr[i] = arr[j]

For every time the value of j is less than or equal to value of pivot, i is incremented by 1 and value at index if i is swapped with the value at the index of j. Note that no swapping is done if the i=j.

These steps are repeated as long as j<=high-1. Now the control comes out of the iteration and pivot is swapped from arr[i+1] to arr[high].

In the above array that we have taken to perform quick sort on the pivot value is array[high] = 57.

i = -1 and j = 0, 29 <= 57, i = 0, no swap(since i=j)

I = 0 and j = 1, 60 >57, no swap

i = 0 and j = 2, 44<=57, i = 1, swap 60<>44

29 | 44 | 60 | 19 | 30 | 59 | 57 |

i = 1 and j = 3, 19<=57, i = 2, swap 60 <> 19

29 | 44 | 19 | 60 | 30 | 59 | 57 |

i = 2, j = 4, 30<=57, i = 3, swap 60<>30

29 | 44 | 19 | 30 | 60 | 59 | 57 |

i = 3, j = 5, 59>57, no swap

We come out of the loop because j is now equal to high.

Finally, we place pivot at the correct position by swapping

arr[i+1] and arr[high]

So since i = 3, we will replace the pivot value 57 with i+1 that is, at i= 4.

29 | 44 | 19 | 30 | 57 | 59 | 60 |

Now the pivot value 57Â is placed at the correct position with all values smaller to it has been moved left to it and all values larger than it is placed the right side of it.

But we see the array is still not sorted. Hence we will again split the array into two parts. That is:

29 | 44 | 19 | 30 |

And

59 | 60 |

We will again perform partitioning on these two halves until we get the sorted list.

Finally, the sorted array would be:

19 | 29 | 30 | 44 | 57 | 59 | 60 |

**The Quicksort pictorial view :**

**Searching Techniques:Â **The searching operation mentioned above can be done in many ways. The two common ways of searching are:

**Linear Search:Â**this is the simplest method for searching, in this technique of searching the element to be found is searched sequentially in the list. This operation can be performed both on the sorted and unsorted list.

Searching is done from the 0th index and is traversed through the complete list until the element is found or the end of the list is reached.

Linear Search hasÂ **worst-caseÂ **complexity**: O(n)**Â **and best caseÂ **complexity**: O(1)**

**Binary Search:Â**binary search the fastest search algorithm. This algorithm works on the principle of divide and conquer. It requires the list to be in sorted order.

Given a sorted array of n elements, to search an element we compare it with the middle element of the sorted list. If the element matches with the middle element the search is successful, otherwise the list is divided into two equal halves, one from the 0th element to the middle element and another from the center element to the last element.

The searching mechanism proceeds from either of the two halves, if the value of the search key is less than the item in the middle of the interval then it checks on the first half of the division otherwise in the second half of the division.

Binary Search hasÂ **worst-caseÂ **complexity**: O(log n)**Â **and best caseÂ **complexity**: O(1)**

This brings us to the end of this blog. So far we have only read about the Data Structure, Algorithms, Sorting and Searching technique. A lot more is still left to cover like the types of Data Structure and its implementation. So stay tuned for our next blog.

Do leave us a comment for any query or suggestions.

Keep visiting our website for more blogs on Data Science and Data analytics.

Happy Learning ðŸ™‚