1.Sorting:

a. Write a Java program to implement selection sort algorithm on an array of strings to sort them alphabetically. Show results after each pass of sorting.

Sample Output:

Enter how many strings: 5

Input all strings: abcd bcda bbcf fbac accm

Initial Array: abcd bcda bbcf fbac accm

After Pass-1: abcd bcda bbcf accm fbac

After Pass-2: abcd bbcf accm bcda fbac

After Pass-3: abcd accm bbcf bcda fbac

After Pass-4: abcd accm bbcf bcda fbac

b. Suppose you are given a set of integers. Apply MERGESORT algorithm for sorting these integers in ascending order. In addition, report how many times you called MERGESORT (A, p, r) including your very first call, i.e., MERGESORT (A, 1, N) or MERGESORT (A, 0, N-1).

Sample Output:

Enter how many numbers: 6

Input all integers: 20 19 25 29 13 40

Sorted Array: 13 19 20 25 29 40

Total Calls: 11