SHELL SORTING: It is also called diminishing increment sort, named after its discoverer. Shell sort algorithm provides mofo significant improvement on simple insertion sort. This method sorts separate sub-files of the original file. These subfiles contain every k elements of the original file. The value of k is called an increment or a gap. The […]
INSERTION SORTING: – An insertion sort is one that sorts a set of records by inserting records into an existing sorted file. If the initial file is sorted only one comparison is made on each pass so that the sort is O (N). If the file is initially sorted in reverse order, the sort is […]
BUBBLE SORTING: One of the characteristics of this sort is that it is easy to understand and program it is probably the least efficient. The basic idea underlying the bubble sort is to pass through the file sequentially several times. Each pass consists of comparing each element in the file with its successor and interchanging […]
SELECTION SORTING: The selection sort starts from the first element and searches the entire list until it finds the minimum value. The sort places the minimum value i the first place, select the second element, and searches for the second smallest element. The process continues until the complete list is sorted. A selection sort is […]
An array is a list of a finite number of homogenous data elements (i.e. data elements of the same type) Arrays can be classified as One – dimensional array or linear array that requires only one index to access an individual element of the array. Two – dimensional arrays require two indices to access an individual […]
Data: – The term data simply refers to a value or a set of values These values may represent some observation from an experiment, some figures collected during some survey ( such as census, exit polls, etc. ), or marks obtained by a student in an examination, etc. Data Item: – A data item refers […]
The queue is a linear list in which we can insert data from one end and delete data from another end. let’s understand it with a simple example, let’s say we have a line of people at the shop waiting for their turn at the counter. so the person who enters first in the line […]
A stack is a linear list where insertion and deletion can perform only at one end. and the end where we perform the operation is called the top of the stack. It uses Last-In-First-Out (LIFO) functionality means the item that inserts last will out first. In the technical form insertion operation in the stack is […]
Sorting is a technique for arranging a set of data in some order like ascending or descending. we have different types of methods to apply to sort in ascending or descending order. and these methods are divided into two categories. Internal Sorting If we have enough memory so that the data that we want to […]
A list of a finite number of homogenous data elements that have the same type is called an array. an array can be classified in terms of dimensions as shown below. Types of the array in Data Structure Linear/One-dimensional arrays Two-dimensional arrays Multi-dimensional arrays How to access elements of the array As we know that […]
