Question

Question 10: Given an array of data:

array1

10 5 15 2 7 21

Write the code for the selection sort to sort the data and draw a table showing how the data is sorted using selection sort.

Write the code for Binary search algorithm to find the value 15 from the sorted array. Draw the tree diagram showing the binary search of the list.

Answer 1

SOURCE CODE:

*Please follow the comments to better understand the code.

**Please look at the Screenshot below and use this code to copy-paste.

***The code in the below screenshot is neatly indented for better understanding.


def insertion_sort(A):
    # n is the length of the array
    n = len(A)
    # take a for loop
    for i in range(1, n):
        v = A[i]
        j = i - 1
        # while loop
        while j >= 0 and A[j] > v:
            A[j + 1] = A[j]
            j = j - 1
        A[j + 1] = v
        

# run 1
A = [10, 5, 15, 2, 7, 21]
print("A before sorting", A)
insertion_sort(A)
print('A after sorting', A)

================

TABLE :

Tree Diagram for Binary Search: