Quick Sort Introduction: The Quick Sort is based on partition. It is also known as Partition Exchange sorting. The basic concept of quick sort process is pick one element from an array and rearranges the remaining elements around it. This element divides the main list into two sub lists. This chosen element is called pivot. […]Continue Reading... 1 Comment.
Insertion Sort Introduction: In insertion sort the element is inserted at an appropriate place similar to card insertion. Here the list is divided into two virtual parts called unsorted and sorted. In each pass, the first element of unsorted sub list is picked up and moved into the sorted sub list by inserting it in […]Continue Reading... No Comments.
Selection Sort Introduction: In selection sort the list is divided into two sub-lists sorted and unsorted. These two lists are divided by imaginary wall. We find a smallest element from unsorted sub-list and swap it to the beginning. And the wall moves one element ahead, as the sorted list is increases and unsorted list is […]Continue Reading... No Comments.
Bubble Sort Introduction: In bubble sort method the list is divided into two virtual sub-lists called unsorted and sorted. The smallest element is bubbled from unsorted sub-list to sorted sub-list. After moving the smallest element the imaginary wall moves one element ahead. The bubble sort was originally written to bubble up the highest element in […]Continue Reading... No Comments.
Sorting in Data Structure Introduction: Sorting in Data Structure, is a technique to rearrange the elements of a list in ascending or descending order, which can be numerical, lexicographical, or any user-defined order. Sorting is a process through which the data is arranged in ascending or descending order. Sorting can be classified in two ways: […]Continue Reading... No Comments.
Binary Search Introduction: Binary Search is quicker than the linear search. However, it cannot be applied on unsorted data structure. The binary search is based on the approach divide-and-conquer. The binary search starts by testing the data in the middle element of the array. This determines target is whether in the first half or second […]Continue Reading... 1 Comment.
Linear Search Introduction: Linear search technique is also known as sequential search technique. The linear search is a method of searching an element in a list with sequential manner. In this technique, the array/list is searched for the given element from the beginning to end of array/list. The searching as continued up to element has […]Continue Reading... No Comments.
Linear (Sequential) Queue This Linear (Sequential) Queue, is a linear list DATA STRUCTURE used to represent a linear list and permits deletion to be performed at one end of the list and the insertion at the other end. The information in such a list is processed in the same order as it was received, that […]Continue Reading... No Comments.
STACK Operations In this STACK Operation Article, A STACK is defined formally as a list (a linear DATA STRUCTURE) in which all insertion and deletions are made at one end called the Top Of Stack (TOS). The fundamental operations, which are possible on a stack, are: Push (Insertion) Pop (Deletion) Peep (Extract Information) Update (Update information associated at some […]Continue Reading... No Comments.
Applications of STACK Introduction: There are three applications of STACK are used. The first application deals with recursion. Recursion is an important facility in many programming languages such as ALGOL 60 and PASCAL. There are many problems whose algorithmic description is best described in a recursive manner. The second application of a stack is classical; […]Continue Reading... No Comments.