1. Both mergesort and quicksort uses divide and conquer paradigm to sort unsorted list.(a) Imagine you want to write the quicksort algorithm to sort an array into non-increasingorder. Write down the partition algorithm that is used in the divide phase in thequicksort algorithm. Show that the time complexity of this algorithm is 0(n).(b) Identify the worst case situation in the naive quicksort algorithm and show that in theworst case situation its time complexity is O(n2) You have N magical bags of candies in front of you. The ith bag has A; candies in it. It takesyou one minute to finish a bag of candies, no matter how many candies are in it. Every time youfinish a bag with X candies in it, the bag is magically replenished with X/2 (rounded down tothe nearest integer) more candies. Write an algorithm that determines the maximum numberof candies you can eat in K minutes. Also determine the time complexity of your algorithm inthe worst case situation.The input is a sequence of integers. The first integer N is the number of bags. The next integerK is the number of minutes you have. The next N integers is the number of candies in thebags. The output of your program is a single integer which represents the maximum numberof candies you can eat.If the input is 5 3 217 4 2. the output would be 14.

Solution (a)The partition algorithm for quick sort : Approach: Starting from the leftmost element…

Answered: 1. Both mergesort and quicksort uses…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Suppose Dr. WhyLie comes up to you and claims that he has invented a super-fastcomparison based priority queue. The speed of the priority queue operations are as follows(n is the number of items currently in the priority queue):a. insert a new item in O(sqrt(log n)) timeb. extract (remove and return) the smallest item from the priority queue in O(sqrt(logn)) time.Explain why Dr. WhyLie must be lying.
Consider the problem of finding the smallest and largest elements in an array of n numbers. For solving this problem, design, respectively, a brute-force algorithm, a divide-and-conquer algorithm, and a presorting-based (transform-and-conquer) algorithm. determine and compare the efficiency in Big-O notation of the above three algorithms.
QuickSort is run for an array A in a manner that PARTITION consistently produces a 5:1 split for the (sub)arrays to be sorted (recursively) next. Picture the recurrence tree for this scenario ... What will be the length of the longest path from the root to a leaf (= deepest depth)in this tree? Group of answer choices log_5/6 (n) ... "log of n with base 5/6" log_6/5 (n) ... "log of n with base 6/5" log_6 (n) ... "log n with base 6" n^log_5(6) ... "n to the power of log_5(6)"
) Which one is the computationally best-case scenario for the insertion sort algorithm. InsertionSort(a[ ]){ int N = size; for (int i = 0; i < N; i++) for (int j = i; j > 0; j--) if (less(a[j], a[j-1])) // compare swap(a, j, j-1); // exchange else break;} A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 C) 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3 D) 10, 10, 1, 1, 2, 2, 3, 3, 4, 4 E) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0
READ AND SOLVE VERY CAREFULLY WITH PYTHONthanks in advance Given a jungle matrix N*M:jungle = [[1, 0, 0, 0],[1, 1, 0, 1],[0, 1, 0, 0],[1, 1, 1, 1,]]Where 0 means the block is dead end and 1 means the block can be used in the path from source to destination. Task: (Use Python)Starting at position (0, 0), the goal is to reach position (N-1, M-1).Your program needs to build and output the solution matrix, a 4*4 matrix with 1’s in positions used to get from the starting position (0,0) to the ending position (N-1, M-1) with the following constraints:- You can only move one space at a time.- You can only move in two directions: forward and down.- You can only pass thru spaces on the jungle matrix marked ‘1’If you cannot reach the ending position, print a message that you’re trapped in the jungle Algorithm:If destination is reached print the solution matrixElse Mark current cell in the solution matrix Move forward horizontally and recursively check if this leads to…
Consider the LCS problem discussed in class. Suppose we only want to compute the length of the LCS of x[1..m] and y[1..n] (i.e. we do not care about the actual subsequence itself). This means we do not need to “traceback” to find the LCS. In this setting, show how the algorithm can be altered so that it only needs min(m,n) + O(1) space rather than m · n space (note that it must be min(m,n) and not O(min(m, n))).
Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 32nlogn steps. For which values of n does insertion sort beat merge sort? Group of answer choices: 1. n < 1024 2. n > 1024 3. n < 16 4. n > 16 5. Merge sort is always better since O(nlogn) is better than O(n^2)
QuickSort is run for an array A in a manner that PARTITION consistently produces a 5:1 split for the (sub)arrays to be sorted (recursively) next. Picture the recurrence tree for this scenario ... What will be the length of the longest path from the root to a leaf (= deepest depth)in this tree? Group of answer choices log_5/6 (n) ... "log of n with base 5/6" log_6/5 (n) ... "log of n with base 6/5" log_6 (n) ... "log n with base 6" n^log_5(6) ... "n to the power of log_5(6)"
QuickSort is run for an array A in a manner that PARTITION consistently produces a 5:1 split for the (sub)arrays to be sorted (recursively) next. In this case, the recurrence equation for QuickSort's runtime is what? Group of answer choices T(n) <= T(5n/10) + T(n/10) + Theta(n) T(n) <= T(5/n) + T(1/n) + Theta(n) T(n) <= T(5n/6) + T(n/6) + Theta(n) T(n) <- T(6n/5) + T(6n) + Theta(n)
Consider the use of the recursive MergeSort algorithm to sort a sequence of n elements. Approximate the largest number of pushes (without corresponding pops) to the stack that will existing at any time during the execution of this algorithm. In other words, approximately how deep will the stack become as the MergeSort algorithm sorts an n-element sequence? You must justify your answer.
A triomino is an L-shaped tile formed by 1-by-1 adjacent squares. Given an 2^n × 2^n board (n ≥ 1) with one missing square, it is always possible to cover the board by triominos without overlapping tiles (you may assume this fact, or consider your solution to this question as a constructive proof) Given an 2^n×2^n board with one missing square, design a divide-and-conquer algorithm to determine how to cover the board with triominos.
I need help with this question please

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS