Chapter 16, Problem 2SA

Q3. list using cach of the two sorting algorithms: mergesort sort and quicksort and prints as output the number of comparisons as well as the execution time for each of the two algorithms for N= 10000, 20000, 40000, 100000, 200000 and 400000. The quicksort should use the last element as the pivot for partition. Present your results in a table of the form shown below and plot the results in two separate charts, one chart for the number of comparisons (for both algorithms in the same chart) and one chart for the execution time (for both algorithms in the same chart). Write a Java program that generates randomly a list of N integers, sorts the generated

If the list has the following items 17   9   11   30   8  20  35  7  5   45   3   28 Apply the quick sort on the above list by using the pivot is always the left item and find  1.The split point in the second partition call.

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.

Create a digit rearrangement function for each numerical item in a list based on ascending or descending order. Examples reorderDigits ([515, 341, 98, 44, 211], "asc") 134, 89, 44, 112] reorderDigits ([515, 341, 98, 44, 211], "desc") [551, 431, 98, 44, 211] reorderDigits ([63251, 78221], "asc") reorderDigits ([63251, 78221], "desc") 87221] [155, [12356, 12278] [65321,

Inse Α' Α' Δ A & E Local backup on 7 index 0 The following algorithm performs an operation on a list of names. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 == 15 names m Ahmed Amin Arnold Bob Beatrice Brad Charlie Chloe Chelsey Elizabeth Gavin Jordan Quan Ursula Weasley Zara first Line Spacing: 1 0 1 last def algorithm (): global names searchName-input ("Enter name to search") 15 first=0 last-len (names) -1 while firstsearchName: last-mid-1 else: Character Spacing: 0 First Line Indent: 0 main () if first>last: def main (): Table1 a)Copy and complete the trace table to trace the flow of execution of algorithm in Figure2. The table contains the state of the variables immediately before the while loop is entered. names are specified in Table 1 and the searchName entered is 'Weasley'. (Assume that the result of integer division is rounded down (e.g. the result of 5//2 is 2) return False first-mid+1 found-algorithm () print (found) mid ♫ A names[mid] result X Exit ][ [

If the list has the following items 17   9   11   30   8  20  35  7  5   45   3   28   Apply the quick sort on the above list by using the pivot is always the left item and  if The list after a first partition call is 7 9 11 3 8 5 17 20 35 40 30 28 (17 is the pivot correct position) ,  find The split point in the second partition call?

Complete a Selection sort on the following values: 2, 22, 12, 21, 3, 1 Each row is one full "pass"/"iteration" through the data:

step Sort the sequence {1, 5, 7, 6, 8, 9} using the Bubble sort algorithm. Show the step. Do llege of Te of Technol& Technology even if Exam, ogy Exam, 202 AN ST 021S, NYC C NYC Colle same. YC College College of Tech ge of Techno of Technology% echnology Ex logy Exam, 20 xam ege of Tech inology Ex nnology Exam Exam, 20

Given an unsorted list, explain how a sequential search works (Be specific)