Merge sort uses which of the following technique to implement sorting? Select one: a. greedy algorithm b. dynamic programming c. divide and conquer d. backtracking

2_b Write the time complexity for each of the following algorithms:{ Counting Sort - Merge Sort - Selection Sort - Binary Search }

The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 2 16 38 9 4 14 How many passes must the algorithm perform to guarantee the entire sequence is sorted? What is the list obtained after the first pass? What is the list obtained after the third pass? What is the list obtained after the final pass?

cite one real-world example where we use bubble sort and selection sort.

Write the algorithm which sorts the array by using the merge sort algorithm. Then find the complexity of the algorithm as Big 0 notation

How does bubble sort work?

ACTIVITIES/ASSESSMENTS:1. Which of the following is example of in-place algorithm?a. Bubble Sort b. Merge Sort c. Insertion Sort d. All of the above 2. Which of the below mentioned sorting algorithms are not stable?a. Selection Sort b. Bubble Sort c. Merge Sort d. Insert Sort 3. Q 10 - A stable sorting algorithm −a. does not crash. c. does not run out of memory.b. does not change the sequence of appearance of elements.d. does not exists.

Which of the following sorting algorithm(s) is/are divide and conquer type? a. Selection sort b. Insertion sort c. Merge sort d. Bubble sort

3. Given the following list: 9 4 2 6 7 5 3 8 Identify the state of the list while being sorted using the selection sort algorithm.

Which of the following algorithms is better to sort a mostly sorted data sequence? A data sequence is mostly sorted if only a handful of integers don't appear in the longest sorted subsequence. For example, the following data sequence is almost sorted since there is only one integer (0) out of place in a sorted sequence of numbers:  1, 2, 3, 4, 0, 5, 6, 7, 8, 9   Question 28 options:   merge sort   selection sort   insertion sort   quick sort