Question

Can Anyone help me to answer these question regarding Algorithm in the computer science?

1) a) Describe the merge helper method of Merge Sort.

     b) What are real life examples of Bubble Sort, Selection Sort, and Insertion Sort?

    c) What does it mean for a tree to be complete?

    d) Describe the partition helper method of Quicksort.

    e) What are two real life examples of a Priority Queue?

   f) Draw a min heap with at least 8 nodes.

Answer 1

a)

The merge helper method of the Merge sort algorithm is used to merge two sorted arrays into a single sorted array.

b)

Consider you have 8 shoes pairs with sizes 6 to 13. You find them not in order. Their arrangement from smallest to largest will be an example of selection sort.

Lined up in a random order in front of the teacher, who’s put to the task of lining you all up in an ascending order of height. The bubble sort algorithm comes in handy here.

When we are playing cards each time we take new card and insert at its proper position that's an example of insertion sort.

c)

A Binary Tree is complete Binary Tree if all levels are completely filled except possibly the last level and the last level has all keys as left as possible

d)

partition (arr[], low, high)
{
    // pivot (Element to be placed at right position)
    pivot = arr[high];  
 
    i = (low - 1)  // Index of smaller element

    for (j = low; j <= high- 1; j++)
    {
        // If current element is smaller than the pivot
        if (arr[j] < pivot)
        {
            i++;    // increment index of smaller element
            swap arr[i] and arr[j]
        }
    }
    swap arr[i + 1] and arr[high])
    return (i + 1)
}

NOTE: As per Chegg policy, I am allowed to answer specific number of questions (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused.