Emma, a financial analyst, is working on organizing stock prices efficiently. She needs a program that sorts the given stock prices in ascending order. Your task is to assist Emma by creating a program that inputs the number of stock prices, takes input for each price, applies a bubble sort algorithm, and then displays the sorted stock prices.Input format :The first line of input consists of an integer N, representing the number of stock prices.The second line consists of N space-separated integers, representing the stock prices.Output format :The output prints the stock prices in ascending order, after applying the bubble sort algorithm.Refer to the sample output for formatting specifications.
Question
Emma, a financial analyst, is working on organizing stock prices efficiently. She needs a program that sorts the given stock prices in ascending order. Your task is to assist Emma by creating a program that inputs the number of stock prices, takes input for each price, applies a bubble sort algorithm, and then displays the sorted stock prices.Input format :The first line of input consists of an integer N, representing the number of stock prices.The second line consists of N space-separated integers, representing the stock prices.Output format :The output prints the stock prices in ascending order, after applying the bubble sort algorithm.Refer to the sample output for formatting specifications.
Solution
Sure, here is a Python program that implements the Bubble Sort algorithm to sort the stock prices in ascending order.
def bubbleSort(arr):
n = len(arr)
for i in range(n-1):
for j in range(0, n-i-1):
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
print("Enter number of stock prices:")
n = int(input().strip())
print("Enter the stock prices:")
arr = list(map(int,input().strip().split()))
bubbleSort(arr)
print ("Sorted stock prices are:")
for i in range(len(arr)):
print ("%d" %arr[i],end=" ")
This program works as follows:
- It first asks for the number of stock prices.
- Then it asks for the stock prices themselves.
- It applies the Bubble Sort algorithm to sort the prices in ascending order.
- Finally, it prints the sorted stock prices.
The Bubble Sort algorithm works by repeatedly swapping the adjacent elements if they are in wrong order. It continues this process until no more swaps are needed, indicating that the list is sorted.
Similar Questions
Write a description of bubble sort in programming, give the steps to follow, keep it short
Given an array of size N, implement Bubble Sort.Input FormatThe first line of input contains an integer N - the size of an array. The second line contains the elements of the array.Output FormatFor each iteration of Bubble Sort, print the array elements.Constraints1 <= N <= 201 <= A[i] <= 103ExampleInput65 8 10 15 3 6Output5 8 10 3 6 155 8 3 6 10 155 3 6 8 10 153 5 6 8 10 153 5 6 8 10 15
Bubble Sort is a popular sorting algorithm. It works by repeatedly swapping adjacent elements thatare out of order.a) Write the pseudo code of the bubblesort algorithmb) Implement the bubblesort algorithm.c) Read 8 numbers from the keyboard and store them in an array. Sort the numbers usingthe bubble sort algorithm.
Kumar wants to design a program to analyze race timing data using the bubble sort algorithm. Write a program to help Kumar find and display the second-fastest race time in seconds from a given list of race times.Input format :The first line of input consists of an integer N, representing the number of race times.The second line consists of N space-separated integers, representing the individual race times in seconds.Output format :If N is less than 2, print "Insufficient data to find the second-fastest time."Otherwise, print the value of the second-fastest race time, in seconds.Refer to the sample output for formatting specifications.
You are tasked with implementing one of the classic sorting algorithms: Bubble Sort, Insertion Sort, or Selection Sort. Your goal is to sort an array of integers in non-decreasing order using the chosen algorithm.Input FormatThe input consists of two lines:The first line contains an integer n (1 ≤ n ≤ 100), representing the number of elements in the array.The second line contains n space-separated integers, representing the elements of the unsorted array. These integers are in the range -1000 to 1000.ConstraintsImplement the chosen sorting algorithm to sort the array in-place. Do not use any built-in sorting functions.The array elements are integers in the range -1000 to 1000.Output FormatYou should output a single line with n space-separated integers, representing the elements of the array in non-decreasing order after applying the selected sorting algorithm.Sample Input 0102 3 4 5 1 6 7 8 9 0Sample Output 00 1 2 3 4 5 6 7 8 9Explanation 0It appears you have two lines of input. The first line contains the number 10, which likely represents the total number of elements in the list. The second line contains ten space-separated integers: 2 3 4 5 1 6 7 8 9 0. These are the elements you want to sort in non-decreasing order using a sorting algorithm.So, the sorted version of the list you provided is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, in non-decreasing order.Sample Input 162 4 5 4 6 2Sample Output 12 2 4 4 5 6
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.