1)Use insertion sort to sort a list

38 62 84 11 6 90

Show the sorted list, unsorted list and all operations.

2)Use Binary search to find K=80 in the list

16 18 32 46 80 98 111

Show the l, m, r in each iteration.

3)Use Merge sort for list

56 89 78 25 63 22 7 12 23

1) show divide and merge operations

2) show 1^st, 2^nd, 3^rd, iteration for merge operation on

Array B:

Array C:

4)Use Hoare Partition in Quicksort Algorithm for list

44 52 12 32 62 85 95 63 22 7

1) find out the pivot

2) show where i&j stoped

3) show swap operation

4) show the list after first partition

5) show the split positions value

5)Construct an AVL tree for the following list by successive insertions, start with an empty tree.

25 36 12 8 9 7 45 65 89

1) show operations or type of rotations.

2) show balance factor for each node.