Computer Science, asked by fulchand7835, 8 months ago

Consider the following ordering of integers in an array: 8 , 12 , 45 , 58 , 22 , 18 , 43 , 30 Which of the sorting algorithms could have produced this array above after 3 iterations of its outer loop?

Answers

Answered by shriya1907
7

Answer:

integers in an array: 8 , 12 , 45 , 58 , 22 , 18 , 43 , 30 Which of the sorting algorithms could have produced this array above after 3 iterations of its outer loop?

Answered by mk1012
0

Answer:

Explanation:

onsider the following ordering of integers in an array:

8 , 12  , 45  , 58  , 22  , 18  , 43 , 30

Which of the following sorting algorithms could have produced this array above after 3 iterations of its outer loop?  

1 point

Insertion Sort

Selection Sort

Both Insertion and Selection Sort

Neither Insertion nor Selection Sort

Similar questions