Question

QUESTION 3

1. Suppose that you have been running an unknown sorting algorithm. Out of curiosity, you once stopped the algorithm when it was part-way done and examined the partially sorted array. You discovered that the last K elements of the array were sorted into ascending order, but the remainder of the array was not ordered in any obvious manner.
   Based on this, you guess that the sorting algorithm was (select all that apply):

   		heapsort
   		insertion sort
   		mergesort
   		quicksort
   		Shell's sort

4 points   

QUESTION 4

1. Suppose that you have been running an unknown sorting algorithm. Out of curiosity, you once stopped the algorithm when it was part-way done and examined the partially sorted array. You discovered that the first K elements of the array were sorted into ascending order, but the remainder of the array was not ordered in any obvious manner.
   
   Based on this, you guess that the sorting algorithm could likely be:

   		quicksort
   		heapsort
   		insertion sort
   		Shell's sort
   		merge sort

Answer 1

Question(3):
Given that if an unknown sorting algorithm is stopped in the middle it will sort last K elements

the algorithm may be merge sort or heap sort
In merge sort
The array will be divided into partitions and then it will be sorted after that the partition arrays will be merged since every time the arrays are sorted and merged the last elements will be sorted

In heap sort
If max heap is used after inserting each element in the heap it will be sorted so the last elements will be sorted

Question(4)
Given that if an unknown sorting algorithm is stopped in the middle it will sort first K elements

the algorithm may be insertion sort, shell sort

In insertion sort
The algorithm will select minimum element and then it will place in it's position in sorted array so at any position the first elements will be sorted

In shell sort
It is also work like insertion sort. It is generalization of insertion sort.So at any position the first elements will be sorted.

If you have any doubts please comment and please don't dislike.