Figure 13 shows an algorithm represented in pseudocode.
A developer wants to check the algorithm works correctly.
Line numbers are included but are not part of the algorithm.
Figure 13
1 arr[0] format('truetype')%3Bfont-weight%3Anormal%3Bfont-style%3Anormal%3B%7D%3C%2Fstyle%3E%3C%2Fdefs%3E%3Ctext%20font-family%3D%22math1670c26185a3783678135b4697f%22%20font-size%3D%2216%22%20text-anchor%3D%22middle%22%20x%3D%2210.5%22%20y%3D%2216%22%3E%26%23x2190%3B%3C%2Ftext%3E%3C%2Fsvg%3E){kind=small}
'c'2 arr[1] 'b'3 arr[2] 'a'4 FOR i 0 TO 15 FOR j 0 TO 16 IF arr[j + 1] < arr[j] THEN7 temp arr[j]8 arr[j] arr[j + 1]9 arr[j + 1] temp10 ENDIF11 ENDFOR12 ENDFOR
State the purpose of the algorithm.
Did this page help you?
State one advantage of a merge sort over a bubble sort.
Did this page help you?
State one disadvantage of a bubble sort over a merge sort.
Did this page help you?
Fill in the blank arrays to show the steps involved in applying the bubble sort algorithm to the array [3, 5, 1, 4, 2].
You only need to show the missing steps where a change is applied to the array.
Did this page help you?
Figure 7 shows a merge sort being carried out on a list.
Figure 7
Explain how the merge sort algorithm works.
Did this page help you?
A program stores the following list of positive and negative numbers. The numbers need sorting into ascending order using a merge sort.
45 | 12 | -99 | 100 | -13 | 0 | 17 | -27 |
|---|
The first step is to divide the list into individual lists of one number each. This has been done for you.
Complete the merge sort of the data by showing each step of the process.
Did this page help you?
A library sorts their books based on a book code.
Show the steps that a merge sort would take to put the following list of book codes into ascending alphabetical order (from A to Z).
POE12 , BAC97 , FLY77 , JAV16 , TAL86 , AND18 , ZAR09 , HOP86
Explain one advantage of a merge sort compared to a bubble sort.
Did this page help you?
A program uses a file to store a list of words that can be used in a game.
A sample of this data is shown in Fig. 3.
|
|
|
|
|
|
Fig. 3
Show the stages of a bubble sort when applied to data shown in Fig. 3.
Did this page help you?
Describe the steps involved in performing a bubble sort on the list in Fig. 1. Show the state of the list after each complete pass through the list.
|
|
|
|
|
|
Fig. 1
Did this page help you?