2. Explain when we can have the best case and when we can have the worst case. Give the complexity of your algorithm in each case. ● Best case: Question 1: 0 Worst case: Given an array, that can contain zeros, positive and negative elements. 1. Write an algorithm that calculates the number of positive elements (>0), the number of negative elements, and the number of zeros. Example: ● -5 Number of positive elements: 2 Number of negative elements: 3 Number of zeros: 3 Algorithm: wwwmmm -7 0 -6 8 0

2. Explain when we can have the best case and when we can have the worst case. Give the complexity of your algorithm in each case. ● Best case: Question 1: 0 Worst case: Given an array, that can contain zeros, positive and negative elements. 1. Write an algorithm that calculates the number of positive elements (>0), the number of negative elements, and the number of zeros. Example: ● -5 Number of positive elements: 2 Number of negative elements: 3 Number of zeros: 3 Algorithm: wwwmmm -7 0 -6 8 0

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

ODD-EVEN. Write a snippet code to solve the following. Assume that you have an array of positive integers arr. The array is already full and properly populated with positive int numbers. The array arr is of size SIZE. ( no need to declare it or fill it up, assume it is already there). You will copy all the even numbers into an array of size SIZE called even and You will copy all the odd numbers into an array of size SIZE called odd You will print the total numbers on each array.
Correct answer will be upvoted else Multiple Downvoted. Computer science. you can choose two indices x and y (x≠y) and set ax=⌈axay⌉ (ceiling function). Your goal is to make array a consist of n−1 ones and 1 two in no more than n+5 steps. Note that you don't have to minimize the number of steps. Input The first line contains a single integer t (1≤t≤1000) — the number of test cases. The first and only line of each test case contains the single integer n (3≤n≤2⋅105) — the length of array a. It's guaranteed that the sum of n over test cases doesn't exceed 2⋅105. Output For each test case, print the sequence of operations that will make a as n−1 ones and 1 two in the following format: firstly, print one integer m (m≤n+5) — the number of operations; next print m pairs of integers x and y (1≤x,y≤n; x≠y) (x may be greater or less than y) — the indices of the corresponding operation. It can be proven that for the given constraints it's always possible to find a correct sequence…
A prime integer is any integer that is evenly divisible only byitself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It operates as follows:a) Create an array with all elements initialized to 1 (true). Array elements with prime subscriptswill remain 1. All other array elements will eventually be set to zero. You’ll ignoreelements 0 and 1 in this exercise.b) Starting with array subscript 2, every time an array element is found whose value is 1,loop through the remainder of the array and set to zero every element whose subscriptis a multiple of the subscript for the element with value 1. For array subscript 2, all elementsbeyond 2 in the array that are multiples of 2 will be set to zero (subscripts 4, 6,8, 10, etc.); for array subscript 3, all elements beyond 3 in the array that are multiplesof 3 will be set to zero (subscripts 6, 9, 12, 15, etc.); and so on.When this process is complete, the array elements that are still set to one indicate that the subscriptis a…
The solution must be recursive. inputAndPrintReverse:Inputs integers from the user until the user enters 0, then prints the integers in reverse order. For this method, you may NOT use an array or any type of array structure, in other words, you may not use any structure to store the user input.
A prime number is any integer that is evenly divisible only by itself and 1. The Sieve ofEratosthenes is a method of finding prime numbers. The algorithm is described below.• Create an array with all elements initialized to 1 (true). Array elements with primesubscripts will remain 1. All other array elements will eventually be set to zero.• Starting with array subscript 2, every time an array element i is found whose value is 1,loop through the remainder of the array and set to zero every element whose subscript is amultiple of i. For array subscript 2, all element beyond 2 in the array that are multiples of2 will be set to zero (subscripts 4, 6, 8, 10, etc.); for array subscripts 3, all elements beyond3 in the array that are multiples of 3 will be set to zero (subscripts 6, 9, 12, 15, etc.); and soon.When this process is complete, the array elements that are still set to one indicate that the subscriptis a prime number. These subscripts can then be printed. Write a program that uses…
Exercise 9. Describe in plain English an algorithm that computes the number of common elements in 2 arrays of integers. You can assume that there are no duplicates in the first array, and also no duplicates in the second array. For example if array a₁ = [9, 3, 1, 5, 7, 11] and array a2 = [6, 2, 7, 8, 10, 5, 1], the algorithm should return 3 because the two arrays have three numbers in common, namely 1,5,7. Your algorithm should run in O(n log n) time.
Write code that loops through the array myVals. Each iteration: If myVals[i] is less than smallestNum, assign smallestNum with myVals[i]. Remember to assign smallestNum with some value before the loop.
The following subprogram uses to? for (int i=0;i> input statement is used to receive data from keyboard. False O True
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
Problem 1: Complete the sumOfDiagonals method in SumOfDiagonals.java to do the following: The method takes a 2D String array x as a parameter and returns no value. The method should calculate and print the sum of the elements on the major diagonal of the array x. In order to have a major diagonal, the array passed into the method should be a square (n-by-n), if it's not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays) If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception. When handling the exceptions, be as specific as you can be, (i.e. Do Not just use the Exception class to handle all exceptions in one catch block). Make the proper calls to the sumOfDiagonals method from the main method to test your sumOfDiagonals method on all the String arrays provided in the main method.
A basic iterator offers all the following operations except Group of answer choices 1. Except nothing, it can do all of the listed operations. 2. Get the item at the current iteration 3. Return an array of all items 4. Determine if there are more items 5. Go to the next item
CodeWorkout Gym Course Search exercises... Q Search kola_shreya@columbusstate.edu X173: array220 Given an array of int 5, compute recursively if the array contains somewhere a value followed immediately by that same value times 10. We'll use the convention of considering only the part of the array that begins at the given index.In this way, a recursive call can pass index + 1 to move down the array. The initial call will pass in an index position of 0. Your Answer: 1 public boolean array220(int[] nums, int index) 4} Check my answer! Reset Next exercise Feedbacz CodeWorkout © Virginia Tech About License Privacy Contact H 2 M 45