Data Structure

What is a Graph? A graph is a pair G ={V,E} where‘ V’ is a set of vertices and ‘E’ is a set of edges between the vertices. V = {a,b,c,d} E = { (a, b), (b. c), (c. d), (d, a),(b, d)} Graph Terminology in Data Structure Degree of vertex : No. of edges […]

Bucket Sort Algorithm To sort n input numbers, Bucket Sort Bucket Sort Example Step By Step Question: Illustrate the operation of Bucket Sort on the Array A={0.36,0.15,0.20,0.89,0.53,0.71,0.32} Now, Sorted Array is

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

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

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,