Array Data structure – Full Guide

What is an Array?

An array stores data sequentially in memory space.

Each element of an array can be addressed as an index. In most programming languages, the index of an array begins from 0.

Applications of Array

1. Primary use: To store a list of items. For example: a to-do list, e-commerce shopping cart, names of employees, etc.
2. Arrays can also be used to implement other data structures like Queues, Stacks, Binary Trees, etc. (click on each to learn how)
3. Databases: Arrays are used in databases to store data sequentially.
4. Image data can be stored in 2-dimensional arrays.

Array Operations & Algorithms

Search

Search operation involves searching for a particular element in an array of elements.

Search operations can be performed in an array through the following methods:

1. Linear Search
2. Binary Search

Sort

The sort operation involves arranging the elements of an array in either ascending or descending order.

Sort operation can be performed in an array through the following algorithms:

1. Selection Sort
2. Bubble Sort
3. Quick Sort
4. Merge Sort
5. Insertion Sort
6. Heap Sort