Introduction

An array is a data structure that combines several variables of the same type into a single variable. Instead of having separate variable names for each element, we can use arrays to group them all together into a single variable.
This category contains all of the information you need to know about array fundamentals.

Basic Operations

In computer science, data is the most crucial aspect. To store and manipulate the data, we need a data structure.
Arrays are the type of data structure that will enable us to perform various operations on our data.
We can perform the following operations:
Traversal: print all the array elements one by one
Insertion: adds an element at the specified index.
Deletion: removes an element at the specified index.
Searching: search an element using the given index or by value.
Updation: update an element at the specified index.
In this section, we'll walk you through the operations listed above and let you analyse the time complexity of each with appropriate examples.

Searching Techniques

Storing data is important, but being able to retrieve it when needed is even more important.
For that purpose, there are various searching techniques like linear search, binary search, jump search and Fibonacci search, to name a few.
This section will help us learn all about the different searching techniques.

Searching and Sorting in Rotated Sorted Array | Part-2

By Gorakhnath yadav

● Published At Oct 2021

n this blog, we discussed the method to search an element in a rotated sorted array with duplicate elements. Read the blog to learn it in detail.... Keep reading ..

Sorting Techniques

Data structures are used to store data but usually, data is stored haphazardly. In such situations the need to sort the data arises.
Sorting techniques like selection sort, bubble sort, merge sort, quick sort, insertion sort and heap sort are used to sort data structures.
This section explains the different sorting algorithms.

Radix Sort

By Reet Maggo

● Published At Jan 2022

This article will illustrate the Radix Sort technique while explaining its uses, working, the algorithm, code and the time and space complexity for the algorithm.
... Keep reading ..

Bucket Sort

By Reet Maggo

● Published At Oct 2021

This article will illustrate the Bucket Sort technique and explain its working with the help of a code snippet and algorithm for the chosen example.... Keep reading ..

Counting Sort

By Reet Maggo

● Published At Oct 2021

This article will explain the Counting Sort technique with the help of examples, code and algorithm while discussing its time and space complexity.
... Keep reading ..

Understanding Heap Sort

By Sneha Mallik

● Published At Oct 2021

This blog covers the working and implementation of heap sort in C++, a discussion around its time and space complexity, and the advantages of heap sort.
... Keep reading ..

## Top Problems related to Introduction

MergeSort Linked List

Count Inversions

Overlapping Intervals

Alien dictionary

Number Of Pairs With Given Sum

Count Positive - Negative Pairs

MergeSort Linked List

Closest Distance Pair

Sort 0 1 2

K Most Frequent Words

Minimize The Maximum

Merge Intervals

First Missing Positive

Two Non-Repeating Elements

Distinct Left

Sorted Matrix

Lexicographical order

Minimum K product

Longest Consecutive Sequence

Football Game

Minimum Operations