Standard Algorithms

Question 1

bubble sort

Answer 1

Question 2

binary search

Answer 2

If Q asks for binary search function that is within a list that’s been passed into a procedure then add RETURNS INTEGER to end of first line and RETURN

Question 3

quicksort

Answer 3

Question 4

insertion sort

Answer 4

Question 5

find maximum

Answer 5

Question 6

find minimum

Answer 6

Question 7

(higher) counting occurences

Answer 7

1. 1 occurrences = 0
2. 2 take in value to find
3. 3 for each item
4. 4 if current item = value to find then
5. 5 occurrences = occurrences + 1
6. 6 end if
7. 7 next item in list
8. 8 display occurrences

Question 8

(higher) linear search

Answer 8

1. 1 ask user for value to find
2. 2 take in value to find
3. 3 found = false
4. 4 do
5. 5 if current item = value to find then
6. 6 found = true
7. 7 position = current item position in list
8. 8 end if
9. 9 loop until (found=true) or (end of list)