All categories

3 years ago

Stock Market

Computers and Technology

1 answer:

ra1l [238]3 years ago

3 0

Answer:

stockprice = input("Please enter stock prices: ")

prices = stockprice.split(",")

least = int(prices[0])

highest = int(prices[0])

for price in prices:

if int(price) < least:

least=int(price)

if int(price) > highest:

highest=int(price)

index = prices.index(str(highest))

print("Highest price: "+str(highest)+" ocurred on day # "+str(index))

index = prices.index(str(least))

print("Lowest price: "+str(least)+" ocurred on day # "+str(index))

Explanation:

I added the explanation as an attachment where comments were used to explain each line one after the other.

PS: The question is answered in Python

Download txt

You might be interested in

If a _____ error appears when you run a macro that has worked in the past, some part of the macro code no longer makes sense to

Burka [1]

If a run-time error appears when you run a macro that has worked in the past, some part of the macro code no longer makes sense to excel, ehere run-time denotes the time during which a program is running
This error occurs while the program is running.
Running out of memorywill results in a run-time error.

5 0

3 years ago

HELPPPPPPPP

Reika [66]

The answer is visual hierarchy :)

4 0

3 years ago

Read 2 more answers

Suppose you define a java class as follows: public class test { } in order to compile this program, the source code should be st

likoan [24]

Test.java

The classname and the filename need to match (case sensitive).

5 0

3 years ago

Write a program in C++ to Find the Average of the sum of prime numbers between 1 to any given number

mixas84 [53]

Using the knowledge in computational language in C++ it is possible to write a code that Find the Average of the sum of prime numbers between 1 to any given number

<h3>Writting in C++ code:</h3>

#include <iostream>

using namespace std;

bool isPrime(int n){

for(int i = 2; i < n/2; i++){

if(n%i == 0){

return false;

}

return true;

}

int findPrimeSum(int n){

int sumVal = 0;

for(float i = 2; i <= n; i++){

if(isPrime(i))

sumVal += i;

}

return sumVal;

}

int main(){

int n = 15;

cout<<"The sum of prime number between 1 to "<<n<<" is "<<findPrimeSum(n);

return 0;

}

See more about C++ code at brainly.com/question/19705654

#SPJ1

8 0

1 year ago

The opposite of merging cells is splitting a merged cell

vodomira [7]

True , hope this helps!!

4 0

3 years ago