Answer to Question #211764 in Programming & Computer Science for Jaguar

Question

QUESTION 3 

Suppose a list contains the following elements:

71 47 73 17 77 27 37 7

What is the order of the elements in the list after three passes when selection sort is used?

1. 7 17 73 47 77 27 37 71

2. 7 17 27 71 47 73 77 37

3. 7 17 27 47 77 73 37 71

4. 7 17 27 37 77 73 47 71

QUESTION 4

A graphic representation of an algorithm that hides the details of the algorithm and shows how 

the algorithm flows from beginning to end, is called a __________.

1. Pseudocode 

2. UML

3. Subroutine

4. Gantt chart

QUESTION 5

Which of the following statements regarding sorting algorithms is TRUE?

1. Insertion sort is the most efficient sorting algorithm.

2. Selection sort is more efficient than bucket sort.

3. Heap sort is less sufficient than bubblesort.

4. Merge sort is more efficient that selection sort.

Answer 1

Dear Jaguar, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order