/* Output: 1.Insertion: Enter number of elements of array 5 Enter the elements 5 4 3 2 1 Enter 1.Insertion 2.Shell 3.Radix 3 Sorted elements are 1 2 3 4 5 2.Radix: Enter number of elements of array 5 Enter the elemetns 5 4 3 2 1 Enter 1.Insertion 2.Shell 3.Radix 3 Sorted elements are…… Continue reading Insertion, Shell, Radix Sort
Category: Data Structures
Double Ended Queue
/*Output Enter no. of elements: 5 Enter 5 elements: 1 2 3 4 5 1.Input restriction. 2.Output restriction. 3.Exit 1 1.Insert rear. 2.Delete front. 3.Delete rear. 4.Display. 5.Exit. 1 Enter number to be inserted: 6 1.Insert rear. 2.Delete front. 3.Delete rear. 4.Display. 5.Exit. 2 1.Insert rear. 2.Delete front. 3.Delete rear. 4.Display. 5.Exit. 4 Queue is…… Continue reading Double Ended Queue
Circular queue
/*Output Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 1 Enter element to insert 5 Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 1 Enter element to insert 6 Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 3 5 6 Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 2 Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 3 6 Enter 1.Enqueue 2.Dequeue 3.Display 4.Exit 4 */