Given a group of characters a circular array AL]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: Explanation of example 1: (reter to the figure below) The given array All of character is as follows: AQ={L,B.Q.F.T.M A[index] A[0] A[1] A[2] A[3] A[41 A[5) Output: ContentL B Q Zu2 4 4 -1 2 O Regarding "L", the first bigger character on its right is Example 2: "Q' (i.e., A[2]), and hence 2 is printed. AI={J,P,S,D,N} O Regarding and hence "B" 2 is printed again has also the same on her right, Output: D... and so on. 1.2 -1 4 1 a) Describe how a brute-force approach algorithm would solve the above problem, and explain its complexity. b) Design a more efficient algorithm to solve this problem. [The efficiency of your algorithm is the main driver of the mark], and analyze the complexity of your solution. [full explanation of your answer should be provided] c) Develop a python code to implement your efficient algorithm. [The marks depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms

Given a group of characters a circular array AL]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: Explanation of example 1: (reter to the figure below) The given array All of character is as follows: AQ={L,B.Q.F.T.M A[index] A[0] A[1] A[2] A[3] A[41 A[5) Output: ContentL B Q Zu2 4 4 -1 2 O Regarding "L", the first bigger character on its right is Example 2: "Q' (i.e., A[2]), and hence 2 is printed. AI={J,P,S,D,N} O Regarding and hence "B" 2 is printed again has also the same on her right, Output: D... and so on. 1.2 -1 4 1 a) Describe how a brute-force approach algorithm would solve the above problem, and explain its complexity. b) Design a more efficient algorithm to solve this problem. [The efficiency of your algorithm is the main driver of the mark], and analyze the complexity of your solution. [full explanation of your answer should be provided] c) Develop a python code to implement your efficient algorithm. [The marks depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element.For instance, if A = [6 8 4 3 9], the next bigger element list B = [8 9 9 9 9].
Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]
Given are group of integers separated by space and a single integer, store the group of integers in an array, return the sorted array, reverse order of the array and number of occurrence of single integer in the sorted array. ex. input: group of integers = 5 6 8 3 5 7 2 4 1 4 7 9 5 single integer = 5 output: [1, 2, 3, 4, 4, 5, 5, 5, 6, 7, 7, 8, 9] [9, 8, 7, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1] 3
Consider the array A with elements:[0,5,3,10]What is the value of *(A + 3)
A programming language permits indexing of arrays with character subscripts; for example, CHR_ARRAY[‘A’:’D’]. In such a case, the elements of the array are CHR_ARRAY[‘A’], CHR_ARRAY[‘B’], and so on, and the ordinal number (ORD) of the characters, namely, ORD(‘A’) = 1, ORD(‘B’) = 2, ORD(‘Z’) = 26 and so on, is used to denote the index.Now, two arrays TEMP[1:5, -1:2] and CODE[‘A’:’Z’, 1:2] are stored in memory beginning from address 500. Additionally, CODE succeeds TEMP in storage. Calculate the addresses of (i) TEMP[5, -1], (ii) CODE[‘N’,2] and(iii) CODE[‘Z’,1].
Write a Program for finding the biggest number in an array without using any array function.NB: Use the following numbers in your array 11, 12, 16, 35,78, 3, 54, 64,13, 19 (15)
2. Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. a. Write the mathematical process to find the missing number, i.e. some equation. b. What is the time complexity of finding the missing number in the sequence?
Given an array of positive integers named arr, form a new array evenarr in which copy all the even elements of the array arr. Print the evenarr in output. int arr[8] = {12,5,7,10,23,45,4,86} c++
Create an array of 10 elements. Initialize it as follows. INITIAL array : 58 24 13 15 63 9 8 81 1 a 78 Now split it into middle and store the elements in two different arrays. E.g.-After spliting : 58 24 13 15 b 63 9 8 81 1 c 78 Now create another array “d” of size 5. Fill this array by adding elements of array “b” and array “c”. 67 32 94 16 d 141
Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array