Consider the following algorithm to find all the prime numbers less than a given positive number N Start with all the numbers in an array al =(2,3,4,5,...,N-1). Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to leave {2,3,5,7,9,11,13,15,17.) Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible by 3, leaving {2,3,5,7,11,13,17,..} At the ith iteration, keep all), and filter from a[i+1)..a[L-1), all numbers that are divisible by a[i), where L is the current length of the array. By the end of this process, all the numbers remaining in the array are prime numbers. Using the filter pattern discussed in the notes, write a C program that implements this algorithm. (There are many algorithms to find prime numbers - the question asks for the implementation of the above algorithm, in order to practise the use of the filter pattern. expects that the number N is read from the keyboard and that the numbers are written out on a single line with spaces between them. For example: Input Result Enter the upper limit: 10 2 357 100 Enter the upper limit: 2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97

Consider the following algorithm to find all the prime numbers less than a given positive number N Start with all the numbers in an array al =(2,3,4,5,...,N-1). Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to leave {2,3,5,7,9,11,13,15,17.) Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible by 3, leaving {2,3,5,7,11,13,17,..} At the ith iteration, keep all), and filter from a[i+1)..a[L-1), all numbers that are divisible by a[i), where L is the current length of the array. By the end of this process, all the numbers remaining in the array are prime numbers. Using the filter pattern discussed in the notes, write a C program that implements this algorithm. (There are many algorithms to find prime numbers - the question asks for the implementation of the above algorithm, in order to practise the use of the filter pattern. expects that the number N is read from the keyboard and that the numbers are written out on a single line with spaces between them. For example: Input Result Enter the upper limit: 10 2 357 100 Enter the upper limit: 2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Given an array of integers arr, sort the array by performing a series of pancake flips. In one pancake flip we do the following steps: Choose an integer k where 1 <= k <= arr.length. Reverse the sub-array arr[0...k-1] (0-indexed). For example, if arr = [3,2,1,4] and we performed a pancake flip choosing k = 3, we reverse the sub-array [3,2,1], so arr = [1,2,3,4] after the pancake flip at k = 3. Print out the k-values corresponding to a sequence of pancake flips that sort arr. Example 1: Input: arr = [3,2,4,1] Output: 4, 2, 4, 3 Explanation: We perform 4 pancake flips, with k values 4, 2, 4, and 3. Starting state: arr = [3, 2, 4, 1]. After 1st flip (k = 4): arr = [1, 4, 2, 3] After 2nd flip (k = 2): arr = [4, 1, 2, 3] After 3rd flip (k = 4): arr = [3, 2, 1, 4] After 4th flip (k = 3): arr = [1, 2, 3, 4], which is sorted. Another potential solution is: Output = 3, 4, 2, 3, 1, 2, 1, 1 with a similar explanation. All potential solutions that solve the problem are…
Let A be an array of numbers. In the maximum sub-array problem, your goal is to determine the sub-array A[x . . . y] of consecutive terms for which the sum of the entries is as large as possible. For example, if A = [−2, −3, 4, −1, −2, 1, 5, −3], the maximum sub-array is [4, −1, 2, 1, 5], and the largest possible sum is S = 4 − 1 − 2 + 1 + 5 = 7. Suppose A = [1, 2, −4, 8, 16, −32, 64, 128, −256, 512, 1024, −2048]. Determine S, the largest possible sum of a sub-array of A.
Given an integer array [A], efficiently find a descending sorted triplet such that: A[i]> A[i]> A[k] and 0 <=i<j <k <n, where n is the array size. For example, Input: A[] = {9, 1, 6, 7, 3, 4, 5) Output: Any one of the following triplets: (9, 7,5) (9, 7, 4) (9, 7, 3) (9, 6, 5) (9, 6, 4) (9, 6, 3) a) Design a brute-force algorithm to solve this problem complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity and analyse the complexity of your solution. c) Develop a python code to implement your efficient algorithm. depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
You're given an array arr. Apply the following algorithm to it: find intervals of consecutive prime numbers and consecutive non-prime numbers; replace each such interval with the sum of numbers in it; if the resulting array is different from the initial one, return to step 1, otherwise return the result. Input A non-empty integer array such that: -10000 ≤ arr[i] ≤ 10000 1 ≤ arr.length ≤ 1000 Output An integer array. Examples For arr = [1, 2, 3, 5, 6, 4, 2, 3] the result should be [21, 5]: [1, 2, 3, 5, 6, 4, 2, 3] --> [(1), (2 + 3 + 5), (6 + 4), (2 + 3)] --> [1, 10, 10, 5] [1, 10, 10, 5] --> [(1 + 10 + 10), (5)] --> [21, 5] For arr = [-3, 4, 5, 2, 0, -10] the result should be [1, 7, -10]: [-3, 4, 5, 2, 0, -10] --> [(-3 + 4), (5 + 2), (0 + -10)] --> [1, 7, -10] Solve it in C# please
Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem
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
Let's say that B is an array with a size of n > 6 that has integers from 1 to n-5, inclusive, in it. There are exactly five repeats in B. Explain how to find the five numbers in B that are the same.
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].
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]
Write a program (in mars ) maxarray that computes the double of maximum of values of any given array of length L=7. The computation of the maximum is done in a procedure. For example : if the values in the array are : 14, 5, 85, 17, 9, 1, 47. The result is 170.
The key observation is as follows. If n/2 < A[n/2], then if such anindex exists, it must be in A[1 . . . n/2−1]. This is because A[n/2+1] > A[n/2]+1 >n/2 + 1, A[n/2 + 2] > A[n/2 + 1] + 1 > n/2 + 2 and so on Could you explain why these are true by using actual number and example of array ?A[n/2+1] > A[n/2]+1 > n/2 + 1, A[n/2 + 2] > A[n/2 + 1] + 1 > n/2 + 2 and so on
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…