Answer:
The answer is option b. non-sequential.
Explanation:
The right answer is selection sort algorithm.
Selection sort algorithm:
Selection sort is a simple sorting algorithm.
This sorting algorithm is divided into two parts:
1. the sorted part at the left end
2.the unsorted part at the right end.
initially, the sorted part is empty and the unsorted part is the entire list.
The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array and the process continues.
<u>Algorithm :
</u>
Step 1 : Set MIN to location 0 .
Step 2 : Search the minimum element in the list.
Step 3 : Swap with value at location MIN .
Step 4 : Increment MIN to point to next element.
Step 5 : Repeat until list is sorted.
Sequential algorithm:
The selection sort algorithm sorts an array by repeatedly finding the minimum element from unsorted part and putting it at the beginning.
<u>Algorithm :
</u>
Step 1 : selection Sort(array, size)
Step 2 :repeat (size - 1) times
Step 3 : set the first unsorted element as the minimum
Step 4 : for each of the unsorted elements
Step 5 : if element < current Minimum
Step 6 : set element as new minimum
Step 7 : swap minimum with first unsorted position
end selection Sort
so, in the end the sort algorithm for I between 0 and number_used-1 inclusive is non sequential.
It is selection sort algorithm which defines the outline for i between 0 and number_used-1 inclusive
.
