The algorithm read 2000 numbers (positive and negative). Your algorithm has to print either "Positive is greater..." when the number of positive numbers is more than the number of negative numbers, or it prints "Equal" when the number of positive numbers is equal to the number of negative numbers, otherwise it prints "Negative is greater...". (5 Marks)

The algorithm read 2000 numbers (positive and negative). Your algorithm has to print either "Positive is greater..." when the number of positive numbers is more than the number of negative numbers, or it prints "Equal" when the number of positive numbers is equal to the number of negative numbers, otherwise it prints "Negative is greater...". (5 Marks)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

(b) Let n be an integer. Show that n if the sum of the digits of n is a multiple of 3,then n is a multiple of 3. You must do so by a direct proof. For this problem youmay assume that ∀a, b ∈ Z, ∀m ∈ Z+, (a ≡ x (mod m) ∧ b ≡ y (mod m)) ⇒ ab ≡ xymod m. *Solve by direct proof*
Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
Write an Algorithm that will read the student name and student id, the algorithm will Print the student name and student id, each in separate line. print the count of number of characters in student name (The space is calculated as character) Check the student ID last two digit, if last two digits are even numbers or odd numbers for the student ID which categorized as even, print the summation of odd number inside the student id, and print the count for the even number inside the entered student ID. The student ID which have an odd number in last two digit, print “the last two digits in student ID is odd numbers”. print the summation of even number inside the student id print the count for the odd numbers inside the enter student ID. Example Mohammed Ali Abdullah 1135728 Student Name: Mohammed Ali Abdullah Student ID: 1135728 number of characters: 21 The last two digits in student ID are even numbers The summation of odd numbers is 17 The count of odd numbers is 5
Let n be a positive integer and let MaxCrossing(n) be a function that returns the maximum number of line crossings that you can create by drawing n straight lines. Write down a recursive formula for MaxCrossing(n) and analyze the time complexity of the corresponding recursive algorithm. You must write a formal recursive formula including the base case and general recursive step.
The Babylonian algorithm to compute the square root of a positive number n is asfollows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess3. Set guess = (guess +r)/ 24. Go back to step 2 for as many iterations as necessary. The more you repeat steps2 and 3, the closer guess will become to the square root of n. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm five times, and outputs the answer as a double to two decimal places. Your answer will be most accurate for small values of n.
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
Question #1. Product in the Range [N...M]Write a Program that reads a starting number (N) and ending number (M) and prints all the numbers product betweenthe rangesFor instanceN= 2 M= 6 X=7202*3=6 6*4=24 24*5=120 120*6 =720 Solve with C#
1. Analyze the following code using step account (total number of steps). Give the detailed analysis. What is the asymptotic complexity of the above algorithm?(a) int s = 0;(b) for( int i = 1; i < n; i + +)(c) for (int j = 1; j <= i; j + +)(d) s = s + j;
Algorithms Question Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.
ALGO(A)x = A[0]p = -1r = nwhile (True) { do { p = p + 1 } while (A[p] < x) do { r = r - 1 } while (A[r] > x) if (p >= r ){ return r } exchange A[p] and A[r]} From the above algorithm, we have to state whether the following statements are True or False(With explanation) (A) At the end of each iteration of the while loop of Line 4, each index of A smaller than p contains an integer smaller than x. (B) At the end of each iteration of the while loop of Line 4, each index of A larger than r contains an integer larger than or equal to x. (C) When ALGO terminates, the integer at index r is x.
Write an algorithm without loops that reads 5 distinct integers and displays the largest value. Assume the input values are distinct integers.
# Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime. Your function should return True, if n is prime, and False otherwise. Your algorithm has to be effective for n ~ 1,000,000,000,000.def isPrime(n):