Data Structures

What Is Data Structure?

Data Structure is a way of collecting and organizing data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage. For example, we have data player’s name “Virat” and age 26. Here “Virat” is …

What Is Data Structure? Read More »

What is Selection Sorting Algorithms?

What is Selection Sorting Algorithms? Selection Sorting Algorithms Selection sorting is conceptually the most simplest sorting algorithm. This algorithm first finds the smallest element in the array and exchanges it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continues in …

What is Selection Sorting Algorithms? Read More »

Quick Sort Algorithm

What is Quick Sort Algorithm? Quick Sort, as the name suggests, sorts any list very quickly. Quick sort is not stable search, but it is very fast and requires very less additional space. It is based on the rule of Divide and Conquer(also called partition-exchange sort). Quick Sort algorithm divides the list into three main …

Quick Sort Algorithm Read More »

Merge Sort Algorithm

Merge Sort follows the rule of Divide and Conquer. But it doesn’t divides the list into two halves. In merge sort the unsorted list is divided into N sublists, each having one element, because a list of one element is considered sorted. Then, it repeatedly merge these sublists, to produce new sorted sublists, and at …

Merge Sort Algorithm Read More »

Heap Sort Algorithm

Heap Sort is one of the best sorting methods being in-place and with no quadratic worst-case scenarios. Heap sort algorithm is divided into two basic parts : Creating a Heap of the unsorted list. Then a sorted array is created by repeatedly removing the largest/smallest element from the heap, and inserting it into the array. …

Heap Sort Algorithm Read More »

Searching Algorithms on Array

Before studying searching algorithms on array we should know what is an algorithm? An algorithm is a step-by-step procedure or method for solving a problem by a computer in a given number of steps. The steps of an algorithm may include repetition depending upon the problem for which the algorithm is being developed. The algorithm …

Searching Algorithms on Array Read More »

What is Linear Linked List?

Linear Linked List The element can be inserted in linked list in 2 ways: Insertion at beginning of the list. Insertion at the end of the list. We will also be adding some more useful methods like: Checking whether Linked List is empty or not. Searching any element in the Linked List Deleting a particular …

What is Linear Linked List? Read More »

What is Circular Linked List?

What is Circular Linked List? Circular Linked List In the circular linked list we can insert elements anywhere in the list whereas in the array we cannot insert the element anywhere in the list because it is in the contiguous memory. In the circular linked list the previous element stores the address of the next element …

What is Circular Linked List? Read More »

Scroll to Top