In this exercise we are given a sequence (array) A = {a;}"-1 such that a; = 0 or a; = 1, Vi e {1,.., n}. Suggest an iterative algorithm that shuffles all elements of A and returns an index k e {1,...,n} such that a; = 0 for all i < k, and a; = 1 for all j > k. One condition for your solution is that it should not use any additional array B onto which to copy temporary elements (no credits will be given to a solution that makes use of such auxiliary storage).

In this exercise we are given a sequence (array) A = {a;}"-1 such that a; = 0 or a; = 1, Vi e {1,.., n}. Suggest an iterative algorithm that shuffles all elements of A and returns an index k e {1,...,n} such that a; = 0 for all i < k, and a; = 1 for all j > k. One condition for your solution is that it should not use any additional array B onto which to copy temporary elements (no credits will be given to a solution that makes use of such auxiliary storage).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

When the number of elementary events n is small, we could implement row 10 inAlgorithm 2.3 with a simple sequential search. The efficiency of the whole algorithmdepends on how fast this linear search finds the smallest index i for which Si−1 <k ≤ Si. How would you organize the weight sequence W before the prefix sums arecalculated? To verify your solution, implement a program that finds a permutationfor the given weight sequence that minimizes the average number of the requiredsequential steps (i.e. increments of i). Also try out different distribution
For an array A of size N and A[0] > A[N-1] (0 indexed), devise an efficient algorithm to find a pair of adjacent elements A[il and A[i+1] such that Ali] > A[i+1]. Can you always find such an adjacent pair and why? Justify your conclusion with proof.
You are given an arrayof colors (reds, whites, and blues), in no particular order. Sort them into the order of redsfollowed by whites followed by blues.a. Devise an efficient algorithm to solve this problem.b. What is your algorithm's time complexity?For example, if red is represented by 2, white represented by 4 and blue is represented by 6,your input and output array could be of following form:Input: [ 4 6 2 4 2 6 4 2 6 4 4 2 4 ]Output: [ 2 2 2 2 4 4 4 4 4 4 6 6 6]
Suppose you are given a very long array A, whose first n elements are integers (in arbitrary order) and the remaining elements are the special symbol 1. You can access any position I in A by referring to A[i]. However, you do not known. Give a n algorithm for determining n. Analyze the number of accesses to A made by your algorithm ,in terms of n. For full credit, your algorithm must make O(logn) accesses to A
Given 2 sorted arrays (in increasing order), find a path through the intersection that produces the maximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from the array with greater sum. Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81
Given an array A containing N numbers. The problem is to find the minimum gcd among all non-decreasing subarrays. Note: Gcd of k number is the greatest number which divides all k numbers. Example 1: Input : arr[] = {1, 2, 3, 2, 4, 1, 7} Output : 1 Explanation : Some non decreasing subarrays are - {1, 2, 3} gcd = 1, {2, 4} gcd = 2, {1, 7} gcd = 1, minimum gcd = 1
Need help in the deisgning of algorithms. Given an array of numbers as the input, devise an algorithm to generate arandom permutation of the array, such that each number has equal probability to be placed in each position in the output array.
Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n. For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1]. If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
Given an array A = [10, 7, 4, 2, 1], and target = 7, return the index of the target if found, else return -1. 1. Can this problem be solved in O(logN)? 2. If so, write the implementation. Mention time and space complexity 3. If this problem cannot be solved using O(logN), what is the solution that you suggest - write the code and also mention time and space complexity.
The recursive algorithm below takes as input an array A of distinct integers, indexed between s andf, and an integer k. The algorithm returns the index of the integer k in the array A, or ?1 if the integerk is not contained within A. Complete the missing portion of the algorithm in such a way that you makethree recursive calls to subarrays of approximately one third the size of A.• Write and justify a recurrence for the runtime T(n) of the above algorithm.• Use the recursion tree to show that the algorithm runs in time O(n).FindK(A,s,f,k)if s < fif f = s + 1if k = A[s] return sif k = A[f] return felseq1 = b(2s + f)=3cq2 = b(q1 + 1 + f)=2c... to be continued.else... to be continued.
Given an array A[1…n] of numeric values (can be positive, zero, and negative) determine the subarray A[i…j] (1≤ i ≤ j ≤ n) whose sum of elements is maximum over all subvectors. Below is a brute-force algorithm. Analyze its best case, worst case and average case time complexity in terms of a polynomial of n and the asymptotic notation of ɵ. You need to show the steps of your analysis.
Given an array A and a positive integer k, the selection problem amounts to finding the largestelement x ∈ A such that at most k elements of A are less than or equal to x, or nil if no suchelement exists. A simple way to implement it is as follows:SimpleSelection(A, k)1 if k > A.length2 return nil3 else sort A in ascending order4 return A[k]Example A = (29, 28, 35, 20, 9, 33, 8, 9, 11, 6, 21, 28, 18, 36, 1) k = 6