C++ Project: Implementing Sorting Algorithms and Call Center Queues

This project encompasses two primary tasks: the first involves the development and comparative analysis of sorting algorithms. The student implemented three sorting algorithms (bubble sort, insertion sort, and a chosen algorithm) in C++. The program was designed to measure and compare the execution times of these algorithms on datasets of varying sizes (10, 100, 1000, and 10,000 integers). The report includes descriptions of each algorithm with pseudocode and flowcharts, full code listings with comments, tables of results, and justifications for the best algorithm for different data set sizes. The second task focuses on simulating a bank's call center using a queue data structure. The program simulates call handling, tracking waiting calls, and calculating average wait times. The student was required to design and implement a C++ program with functionalities for adding, removing, and updating calls in the queue. Object-oriented techniques were utilized to create new memory objects for each call. The report includes a discussion of the data structure used, a specification, a working C++ program, and an evaluation of the program, along with suggestions for improvement. The project demonstrates proficiency in data structures, algorithm analysis, and C++ programming.