Flowgorithm - Sorting Numbers using Counprogramting Sort.

The student's programming assignment.

Submit the flowchart in Flowgorithm that solves the following exercise.

Title: Sorting Numbers using Counting Sort

Description:

This program demonstrates the implementation of the Counting Sort algorithm to sort a list of integers in ascending order. Counting Sort is a non-comparison-based sorting algorithm that works well for integers within a specific range. The program prompts the user to enter a list of numbers, then sorts them using Counting Sort, and finally displays the sorted list.

Features:

1. User Input: The program allows the user to input a list of integers.

2. Sorting Algorithm: It employs the Counting Sort algorithm to sort the list efficiently.

3. Output: The sorted list is displayed to the user.

Program Flow:

1. Input Phase:

o Prompt the user to enter the number of elements in the list (n).

o Allow the user to input n integers into an array.

2. Sorting Phase:

o Find the minimum and maximum values in the input array to determine the range of values.

o Initialize an array to count the occurrences of each value within the range.

o Count the occurrences of each value in the input array using the counting array.

o Rearrange the elements based on their counts to obtain the sorted list.

3. Output Phase:

o Display the sorted list to the user.

Instructions for Students:

1. Understanding the Algorithm: Students should study the Counting Sort algorithm and understand its working principle.

2. Flowchart Design: Create a flowchart representing the algorithm's logic using Flowgorithm.

3. Implementation: Translate the flowchart into code using the Flowgorithm environment.

4. Testing: Test the program with various input cases to ensure correct functionality.

5. Documentation: Document the program, explaining its purpose, algorithm, and how it works.

Note to Students:

• Pay attention to variable declarations, loops, and array manipulation.

• Understand how the counting array is used to rearrange the elements and achieve sorting.

• Test your program thoroughly with different input values to validate its correctness.