Flowgorithm - Sorting Numbers using Selection Sort algorithm.

The student's programming assignment.

Submit the flowchart in Flowgorithm that solves the following exercise.

Title: Selection Sort Algorithm Implementation

Description:

In this programming assignment, you will implement the Selection Sort algorithm using Flowgorithm. The Selection Sort algorithm is a simple sorting algorithm that repeatedly selects the smallest (or largest) element from an unsorted array and moves it to the beginning (or end) of the array. This process is repeated for each subsequent element until the entire array is sorted.

Objective:

The objective of this assignment is to:

1. Understand the Selection Sort algorithm.

2. Implement the Selection Sort algorithm using Flowgorithm.

3. Practice working with arrays and loops in Flowgorithm.

4. Gain experience in designing and implementing algorithms in a visual programming environment.

Program Description:

1. The program begins by declaring integer variables n, i, and j.

2. It prompts the user to enter the size of the array (n) and stores it in the variable n.

3. It declares an integer array data of size n.

4. A loop iterates from 0 to n - 1, prompting the user to enter n numbers one by one, which are then stored in the array data.

5. After all numbers are entered, the program displays the unsorted array.

6. The program then proceeds to implement the Selection Sort algorithm to sort the array data in ascending order.

7. The sorting algorithm involves nested loops: an outer loop from 0 to n - 2, and an inner loop from i + 1 to n - 1. In each iteration of the outer loop, the algorithm finds the index of the minimum element in the unsorted portion of the array and swaps it with the element at index i.

8. After sorting is completed, the program displays the sorted array.

Flowchart Design:

1. Input: The user inputs the size of the array and each element of the array.

2. Process: The Selection Sort algorithm is applied to sort the array.

3. Output: The unsorted and sorted arrays are displayed to the user.

Expected Learning Outcomes:

1. Understanding of sorting algorithms, particularly the Selection Sort algorithm.

2. Familiarity with working with arrays and loops in Flowgorithm.

3. Improved problem-solving skills and algorithmic thinking.

4. Enhanced ability to translate algorithms into code using visual programming tools.

5. Practice in designing and implementing algorithms efficiently.

Note: Before starting the assignment, ensure that you have a good understanding of the Selection Sort algorithm and basic programming concepts such as loops and arrays.