Task 1) Construct the unsorted sequence of words

Subject:Computer SciencePrice: Bought3

Share With

• Task 1) Construct the unsorted sequence of words.
  • Select a long different quote from one of your favorite books. Keep the first 12 words
  • Replace the letters as follow: f -> a (f with  a), g -> b, h->c, i->d , j->e, k->a, l->b, m->c, n->d, o->e, p->a, q->b, r->c, s->d, t->e, u->a, v->b, w->c, x->d, y->e, z->a. Change the text all in lower case letters
  • Select the obtained 12 words of variable size.
• In the following tasks we will apply MSD to sort the twelve words using textbook raw method.
• For each of the following tasks show the result after the sort but before calling recursively the sort for the subarrays with equal keys. Task 2 will be the entire initial array. Task 3 the first subarray, having the same letter on the first position. And so on. if you finish sorting in fewer than 7 steps, specify after the last task somethinkg like: "Task 7-8 Array sorted nothing else to do. " You  do  not need to sort completely, but only to show the first 7 sorting tasks.