Below is your exercise for Advanced Sorts. To start, create your own set of 10 numbers in an array that are not sorted. Using your array, do the following exercises: Show how the Mergesort algorithm sorts your array by: 1) Showing which sub parts of the array are being examined with each recursive call to Mergesort 2) Showing the results of the array each time the Merge function is used Your demonstration should be similar to slides 19-33 in the Mergesort presentation. You do not have to show the details of the function calls in the stack (unless it helps you), but do explain what is happening at each step to show understanding of the algorithm. Using your same original array, show how the Quicksort algorithm sorts this array by: 3) Showing the results of the array each time the Partition function is used 4) Showing which sub parts of the array are being examined with each recursive call to Quicksort Your demonstration should be similar to slides 35-64 in the Quicksort presentation.…

Assume the following list is being sorted using the Quick Sort algorithm. Describe the next step in the quick sort algorithm in terms of its effect on the pivot, left, and right indices and the content of the list. Note: For credit, do not just give a general description of the quick sort algorithm. Describe in this specific situation, what's compared to what, whether any data is moved, and how the indices are changed. pivot [0] [1] [2] [3] [4] [5] [6] [6] [7] [9] [8] [10] 34 25 39 94 17 78 41 45 91 56 77 86 left right

Use the Quick sort method as discussed in the note and video clip to sort the following items given in this order. Display all the steps of moving the pointers (L) and (R), switching of the items and the final placement of the Pivot up to the first partion. Use 21 as the Pivot. Pivot L R ↓↓ ↓ 21 6 14 35 27 10 47 31 19

Using binary search approach, write a python function named update_record, which takes the following inputs: 1: students_records – Nested List of Tuples. Each tuple of the list represents student's data. 2: ID – An ID of a student whose data has to be updated 3: record_title – type of data that has to be updated 4: data – A new data that should replace record_title data and update the record of students' data associated to specific ID. If ID is given as the data to be updated, then return a message that ID cannot be updated. If ID is not found in students_records, then return a message that Record not found. NOTE: The type of record_title input can be "ID", "Email", "Mid1" or "Mid2". Please use the same spelling for these types in your code, because the same have been used in test cases. Test cases are attached below: student_records = '[("aa02822", "ea02822", 80, 65),("ea02822", "ea02822@st.habib.edu.pk", 80, 65),("fa08877", "fa08877@st.habib.edu.pk", 66, 67),("gh04588",…

That's enough for you! def first_preceded_by_smaller(items, k=1): Given a list of items, find and return the value of the first element for which at least k smaller elements precede that element in items. If no such element exists inside the list, this function should return None. The required k smaller items do not need to be consecutive immediate predecessors of the current item, but can be any k items positioned before the current element. items k Expected result [4, 4, 5, 6] 2 5 [42, 99, 16, 55, 7, 32, 17, 18, 73] 3 18 [42, 99, 16, 55, 7, 32, 17, 18, 73] 8 None ['bob', 'carol', 'tina', 'alex', 'jack', 'emmy', 'tammy', 'sam', 'ted'] 4 'tammy' [9, 8, 7, 6, 5, 4, 3, 2, 1, 10] 1 10 [42, 99, 17, 3, 12] 2 None

Write a version of the sequential search algorithm that can be used to search a sorted list.

Function Name: odd_even_diagParameters: a 2D list (list of lists)Returns: list of lists Description: Given a 2-dimensional matrix (list of lists) with any size (n*n), modify it according to the following rules: Find the sum of the main diagonal. If the sum is an odd number, change all the values of the given matrix (except the main diagonal) to 0. If the sum is an even number, change all the values of the given matrix (except the main diagonal) to 1. Return the resulting matrix. Example 1:If argument is: [[1, 2], [4, 3]] odd_even_diag should return: [[1, 1], [1, 3]] because the sum 1 + 3 is even. Example 2:If argument is: [[1, 2, 3], [4, 5, 6], [7, 8, 9]] odd_even_diag should return: [[1, 0, 0], [0, 5, 0], [0, 0, 9]] because the sum 1 + 5 + 9 is odd.

Exercise 1:In this problem, we would like to implement a variation of the Bubble Sort algorithm. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. The algorithm is illustrated as in the following figure: For the first step, we perform bubble sort from the index 1 to n (n is thenumber of elements in the array). The next step, we perform a reserved bubble sort from the index n to 1. The process is repeated until all the array is sorted. Propose a pseudo-code to complete the Bubble Sort algorithm. Implement and test this algorithm in C/C++. Analyze and compute the complexity of this algorithm in the best, average and worst scenarios.Exercise 2:Re-implement Exercise 1 using a linear data structure: List, Stack, Queue. Justify your choice of data structure.

This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient…