Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem 7P
(a)
Program Plan Intro
To argue that
(b)
Program Plan Intro
To prove that
(c)
Program Plan Intro
To argue that treating columnsort as an oblivious compare-exchange algorithm, even as it does not know the sorting method taken in odd steps.
(d)
Program Plan Intro
To prove that after steps1-3, the array consists of some clean row of 0’s at the top, some clean rows of 1’s at the bottom and at most s dirty rows between them.
(e)
Program Plan Intro
To prove that after step4, the array read in column-major order starts with a clean area of 0’s ends with a clean area of 1’s and has a dirty area of at most
(f)
Program Plan Intro
To prove that steps 5-8 produce a fully sorted 0-1 output.
(g)
Program Plan Intro
To find the value ofr that compared with s for column-sort to correctly sort when s does not divide r .
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Study the function matrix_mult that takes two 2D arrays and performs a
matrix multiplication and returns a new two-dimensional array. Each array
should be represented as a list of lists. For example,
A = [[1, 2, 3], [-2, 3, 7]]
B = [[1,0,0],[0,1,O],[0,0,1]]
matrix_mult(A, B)
[[1, 2, 3], [-2, 3, 7]]
Identify all lines that are in error - that is, select all answers that are correct.
def matrix_mult(A, B):
A_n = len(A)
A_m = len(A[0])
B_n = len(B)
B_m = len(B[0])
assert A_m = B_n
R_n = A_n
1.
2.
3.
4.
5.
6.
7.
8.
R_m = B_m
R = [[0 for j in range (R_m)] fori in range(R_n)]
def row(M, r): return v[c] for v in M
def col(M, c): return M[r]
def dot(v1, v2): return sum([x*y for x, y in zip(v1, v2)]) for i in range(R_n):
for j in range (R_m): R[i][j] - dot(row(A,i), col(8,j))
return R
9.
10.
11.
12.
13.
14.
please convert the code to C language
//C++ program to check if two arrays //are equal or not
#include <bits/stdc++.h>using namespace std;
bool similar_array(vector<int> arr1, vector<int> arr2){ //create teo different hash table where for each key //the hash function is h(arr[i])=arr[i] //we will use stl map as hash table and //will keep frequency stored //so say two keys arr[0] and arr[5] are mapping to //the same location, then the location will have value 2 //instead of the keys itself //if two hash tables are exactly same then //we can say that our arrays are similar map<int, int> hash1; map<int, int> hash2;
//for each number for (int i = 0, j = 0; i < arr1.size(); i++, j++) { hash1[arr1[i]]++; hash2[arr2[i]]++; }
//now check whether hash tables are exactly same or not for (auto it = hash1.begin(), ij = hash2.begin(); it != hash1.end() && ij != hash2.end(); it++, ij++) {…
UAA: [109, 105, 114, 122, 97, 98, 101]Use C++ if programmed <-- not required to.
Using your UAA, apply the Lomuto’s Partioning Algorithm. Write the initial array and trace the content of the array and the positions of the indices (s, i) for each iteration in i, and for the final swap.
Chapter 8 Solutions
Introduction to Algorithms
Knowledge Booster
Similar questions
- ALGO2(A)// A is an integer array, index starting at 11:for i=1 to n-1 do2: for j=n to i+1 do3: if (A[j] < A[j-1]) then4: exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n? Option 1) a*(n^2) + b*n +c, where a,b,c are constantsOption 2) a*n + b , where a and b are constantsOption 3) a * n * log(n) + b, where a,b are constantsOption 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constantsarrow_forwardModify the FindBestPlan(S) function to create a function FindBestPlan(S, O),where O is a desired sort order for S, and which considers interesting sortorders. A null order indicates that the order is not relevant. Hints: An algorithmA may give the desired order O; if not a sort operation may need to be added to get the desired order. If A is a merge-join, FindBestPlan must be invoked on the two inputs with the desired orders for the inputs.arrow_forwardSets are collections (1) without defined order and (2) not allowing duplication. Multisets, also called “bags” are collections without defined order but which permit duplication, i.e., more than one element. We define the function #(a B) to be the number of occurrences of the element a in the bag B. For example, #(1, [1 1 2 3 4 4 5]) is 2 and #(5, [1 1 2 3 4 4 5]) = 1. Bag union and intersection are defined in terms of #. bag-union: List × List -> ListThis function should take as arguments two lists representing bags and should return the list representing their bag-union. bag-intersection : List × List -> ListThis function should take as arguments two lists representing bags and should return the list representing their bag-intersection. Allowed functions. Your code must use only the following functions:1. define, let2. lambda3. cons, car, cdr, list, list?, append, empty?, length, equal?4. and, or, not5. if, cond6. +, -, /, * Racket code only please. Thank you!arrow_forward
- Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also called “bags” are collections without defined order but which permit duplication, i.e., more than one element. We define the function #(a B) to be the number of occurrences of the element a in the bag B. For example, #(1, [1 1 2 3 4 4 5]) is 2 and #(5, [1 1 2 3 4 4 5]) = 1. Bag union and intersection are defined in terms of #. bag-union: List × List -> List This function should take as arguments two lists representing bags and should return the list representing their bag-union. bag-intersection : List × List -> List This function should take as arguments two lists representing bags and should return the list representing their bag-intersection. Allowed functions. Your code must use only the following functions:1. define, let2. lambda, curry3. cons, car, cdr, list, list?, append, empty?, length, equal?4. and, or, not5. if, cond6. map, append-map, andmap, ormap, filter, apply7. +, -,…arrow_forwardSets are collections (1) without defined order and (2) not allowing duplication. Multisets, also called “bags” are collections without defined order but which permit duplication, i.e., more than one element. We define the function #(a B) to be the number of occurrences of the element a in the bag B. For example, #(1, [1 1 2 3 4 4 5]) is 2 and #(5, [1 1 2 3 4 4 5]) = 1. sum : List × List -> List This function should take as arguments two lists representing bags and should return the list representing the list resulting from simply appending the input lists together. Racket code only please. No loops Allowed: 1. define, let2. lambda, curry3. cons, car, cdr, list, list?, append, empty?, length, equal?4. and, or, not5. if, cond6. map, append-map, andmap, ormap, filter, apply7. +, -, /, * Thank you!arrow_forwardSets are collections (1) without defined order and (2) not allowing duplication. Multisets, also called “bags” are collections without defined order but which permit duplication, i.e., more than one element. We define the function #(a B) to be the number of occurrences of the element a in the bag B. For example, #(1, [1 1 2 3 4 4 5]) is 2 and #(5, [1 1 2 3 4 4 5]) = 1. Bag union and intersection are defined in terms of #. bag-union: List × List -> ListThis function should take as arguments two lists representing bags and should return the list representing their bag-union. bag-intersection : List × List -> ListThis function should take as arguments two lists representing bags and should return the list representing their bag-intersection. Allowed functions. Your code must use only the following functions:1. define, let2. lambda3. cons, car, cdr, list, list?, append, empty?, length, equal?4. and, or, not5. if, cond6. +, -, /, * No loops or use of hash Racket code only please.…arrow_forward
- Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also called “bags” are collections without defined order but which permit duplication, i.e., more than one element. We define the function #(a B) to be the number of occurrences of the element a in the bag B. For example, #(1, [1 1 2 3 4 4 5]) is 2 and #(5, [1 1 2 3 4 4 5]) = 1. sum : List × List -> ListThis function should take as arguments two lists representing bags and should return the list representing the list resulting from simply appending the input lists together. Racket code only please. No loops Allowed: 1. define, let2. lambda3. cons, car, cdr, list, list?, append, empty?, length, equal?4. and, or, not5. if, cond7. +, -, /, * Thank you!arrow_forwardPseudo Code shown in Figure Q1(a) is an algorithm for binary searching for an array with n number of elements. By applying this algorithm, show step by step approach on how to find number 11 in an array as depicted in Figure Q1(b). low + 0 high e n-1 while (low s high) do ix + (low + high) /2 if (t = Alix)) then return ix else if (t < A[ix]) then high e ix - 1 else low + ix + 1 return -1 Figure Ql(a) 2 4 6 9 11 12 | 25 [0] [1) [2] [3] (4) [5) [6] Figure Q1(b)arrow_forwardJava Selection Sort but make it read the data 64, 25, 12, 22, 11 from a file not an array // Java program for implementation of Selection Sort class SelectionSort { void sort(int arr[]) { int n = arr.length; // One by one move boundary of unsorted subarray for (int i = 0; i < n-1; i++) { // Find the minimum element in unsorted array int min_idx = i; for (int j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element with the first // element int temp = arr[min_idx]; arr[min_idx] = arr[i]; arr[i] = temp; } } // Prints the array void printArray(int arr[]) { int n = arr.length; for (int i=0; i<n; ++i) System.out.print(arr[i]+" "); System.out.println(); } // Driver code to test above public…arrow_forward
- Sparse matrix-vector multiplication in Python is similar to numpy.dot operation, however the provided @ operator is used. Let us consider multiplying a 5 by 5 sparse matrix with a 5 by 3 sparse matrix shown below. 01000 00010 10001 10000 01000 100 001 x 000 010 100 The Python code to implement multiplication of these two sparse matricesarrow_forwardBubble sort pseudocode: Bubblesort (A, n) // A is array, n items to sort For i = n-1 to 1 For j = 1 to i If A[j] < A[j+1] Swap (A[j], A[j+1]) (A) Determine the big-O running time (tight bound) of bubble sort in the left column. Show your derivation. This pseudocode assumes the array starts at index 1. Count comparisons as the critical operation. Your solution should count the exact number of comparisons as a function of n (number of items being sorted). In converting your formula for number of comparisons to a closed-form formula (as opposed to a summation formula), you do not need to show the derivation (such as writing the summation twice and dividing by two), though it is okay to do that. You do need to show the closed-form formula for exact number of comparisons, before simplifying it to a big-O representation. As a reference, study the stairs examples in the book. See figure 1.2, pg. 20. (B) Prove that f(n) = 1000n5 + 20000n2 + 32 is O(n6 ); Is this a tight upper bound? Why…arrow_forward1. (a) Write a recursive o function for performing binary search on an array of integer. Show how to use this function with sample call from main(). For an input array A={2,6,8,14, 18, 19,37,46, 77}, show each step of algorithm when searching for the value (i) 46 (ii) 17 in the array. (b) Give a structure for storing a active COVID cases in a state. It should consist of the state name (20 characters)and number of active COVID 19 cases (integers) in each state. Each of the 250 students of Btech 1st year (all sections). Inside main () create and array of structure type for holding this information. Write a function that sorts this array in ascending order of active COVID 19 cases, so that we can rank the states in order of the number of cases in each state of the country. (c) Write a function called input() that reads the content of 2-D array( A matrix) row by row. Write a second C function called mult() that takes two matrices and their dimensions as argument and computes. Their…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education