For Example: Number should preserve its position at the time of comparison if they are same. Counting Sort Algorithm pseudocode Counting Sort Example Step By Step Question: Illustrate the operation of Counting Sort on the array A=(6,0,2,0,1,3,4,6,1,3,2) Answer: Here K=6 (highest number in A) For i = 0 to 6 c[i] = 0 i.e, for […]
Counting Sort in Data Structure Read More »
Sorting in linear time algorithm run faster than the comparison based sorting algorithm . But they require special assumption about input sequence . This Algorithm use operations other than comparison to determine the sorted order. Types of Linear Time Sorting Algorithm Counting Sort: Counting Sort assumes that the input consists of integers in a small
Sorting in Linear Time in data Structure Read More »
Disadvantage of radix sort : Radix Sort Algorithm in Data Structure This procedure assume that each element in a array A has (d) digits where digit one is least significant and (d) is most significant digit. Radix Sort Example Step-By-Step Question : < 326, 453, 608, 835, 751, 435, 704, 690 > 326, 453, 608,
Radix Sort in data Structure Read More »
Properties of B-Tree The Height of B-Tree: Thee number of disk access required for most operation on a b-tree is proportional to height of b-tree. So, we analyze worst tree height of b-tree if $n\ge 1$ then for any n key B-tree of height (h) and the minimum degree $ (t) \ge 2 $ the
B-Tree in Data Structure Read More »
Selection Sorting in data structure refers to find the largest ( or smallest ) element in an array repeatedly and move that element to its final position. Advantage of Selection Sorting Disadvantage of Selection Sort Selection Sort C++ The program of selection sort in c++ is as follows: Output of the program selection sort in
Selection Sorting in Data Structure Read More »
Bubble Sorting in data structure also known as exchange sort in which repeatedly list is sorted in which comparing two items at a time and swapping them if they wrong in order. Advantage of Bubble Sorting Disadvantage of Bubble Sort Bubble Sort in C++ Using Function The program specifies how to sort an array using
Bubble Sorting in Data Structure Read More »
What is Sorting in Data Structure Sorting algorithm in data structure refers to ordering data in both ascending and descending order to get a meaningful data which can be analyze easily. we formally define sorting problem as: Input: A sequence of n numbers <$a_{1}.a_{2}…………….a_{n}$> Output: A permutation (re-ordering) < $ a^{‘}_{1},a^{‘}_{2}…………………………..a^{‘}_{n}$> Example of Sorting Problem:
Sorting in Data Structure Read More »