Determine an input array with 7 elements for which Quicksort requires the minimum number of total comparisons. Clearly demonstrate why your input array achieves the minimum number of comparisons, and explain why there cannot exist a 7-element array requiring fewer comparisons than your array.

Create a 2D array of size 14x14 having same values ranging from 0 to 255 in each row. You are free to specify the values of this array. For instance, consider a 3x3 array as;Array [3] [3]= {{12,12,12}, {75, 75, 75}, {247, 247, 247}}12, 75, and 247 pixel values are specified in a way that they are in a range of 0 to 255 and they are same in a row.Write a code namely arraytoimage.c using any pgm (portable gray map) format image that represents an image in a text file in which each pixel is represented by a number ranging from 0 and 255. In this code, write:-P2 (magic number)-Width and height of the image-Maximum grayscale value-Gray scale intensity values you specify in the arrayin an order to this image

Need algorithm design help. Develop a method that produces a random permutation of an array of numbers such that each number has an equal chance of being placed in each output array position.

Please help Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. A subarray is a contiguous subsequence of the array.   Example 1: Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: nums = [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-2,-1] is not a subarray.   Constraints: 1 <= nums.length <= 2 * 104 -10 <= nums[i] <= 10 The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Results: [7, 10] (the underlined portion above)

You have an array with all the numbers from 1 to N, where N is at most 32,000. The array may have duplicate entries and you do not know what N is. With only 4 kilobytes of memory available, how would you print all duplicate elements in the array?