Simulation and Implementation of Insertion Sort Algorithm to Sort Positive Integers Using C++ Programming Language

Sorting is the process of systematically arranging data, initially in an unordered state. That is according to specific rules or criteria (such as numerical or alphabetical order). This process is essential in many fields and applications, including computer science, statistics, and data management, as it facilitates the searching, analysis, and further processing of information. Insertion algorithm is a good algorithm and used in many applications. In this implementation and simulation six figures of positive integers to be sorted are used, namely 30, 2, 5, 7, 11, 1. Each with five processes. After implementation in ascending order there were nine swaps, and in descending order there were only six swaps. The implementation is performed with C++ Programming Language. Two pseudo codes are given, one for ascending and one for descending. The results were a successful implementation and simulation of C++. Screenshot are given to prove that the programs are running smoothly