Data Structures

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 …

What Is Time Complexity of Algorithms? Time complexity of an algorithm signifies the total time required by the program to run to completion. The time complexity of algorithms is most commonly expressed using the big …

Sorting Techniques Sorting is nothing but storage of data in sorted order, it can be in ascending or descending order. The term Sorting comes into the picture with the term Searching. There are so many things …

  which sorts the array by shifting elements one by one. Following are some of the important characteristics of Insertion Sort. It has one of the simplest implementation It is efficient for smaller data sets …

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 …

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 …

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 …

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 …

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 …

  The stack is an abstract data type with a bounded(predefined) capacity. It is a simple data structure that allows adding and removing elements in a particular order. Every time an element is added, it …

What is Queue Data Structures? Queue Data Structures Queue is also an abstract data type or a linear data structure, in which the first element is inserted from one end called REAR(also called tail), and …

A Queue is defined by its property of FIFO, which means First in First Out, i.e the element which is added first is taken out first. Hence we can implement a Queue using Stack for …

Linked List is a linear data structure and it is a very common data structure Linked List consists of a group of nodes in a sequence which is divided into two parts. Each node consists …

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 …

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 …