Implementation of Fundamental Data Structures and Sorting Algorithms

This project focuses on implementing core data structure and algorithm concepts through practical programming applications. The work includes developing a menu-driven Dequeue (Double-Ended Queue) system that allows insertion and deletion operations from both the front and rear ends, along with size tracking functionality. It also involves implementing and comparing two fundamental sorting algorithms: Selection Sort and Bubble Sort. The program allows users to input data dynamically, select the preferred sorting technique, and observe the step-by-step execution by displaying the array after each pass. The project demonstrates understanding of algorithm logic, iterative processes, data manipulation, and efficiency in organizing data. It highlights practical application of theoretical concepts in data structures and algorithm analysis, reinforcing problem-solving and programming fundamentals.