Write a program to sort integers in ascending order. Input is passed in TCL file argument.

Write an algorithm for sorting integer numbers in ascending order using anysorting technique. For example, the unsorted numbers are 23, 45, 12, 37, 11,56 and the sorted numbers in ascending order are 11, 12, 23, 37, 45, 56.

The program must accept N integers as the input. The program must sort the N integers using selection sort and print all the iterations of the selection sorting process as the output.Boundary Condition(s):2 <= N <= 1001 <= Each integer value <= 1000Input Format:The first line contains N.The second line contains N integers separated by a space.Output Format:The lines containing all the stages of the selection sort.Example Input/Output 1:Input:512 6 15 9 10Output:6 12 15 9 106 9 15 12 106 9 10 12 156 9 10 12 15

Problem StatementYou are working as a software engineer for a bus ticketing system. The system needs to handle ticket requests efficiently. Each request arrives at the system with a timestamp representing the time when the request was made. To process these requests in the correct order, you need to sort them by their timestamps before handling them.Your task is to write a program that reads a list of ticket request timestamps, sorts them in ascending order, and then prints the sorted list. The queue of ticket requests will be implemented using a linked list.Input format :The first line consists of an integer n, the number of ticket requests.The second line consists of space-separated integers, representing the request timestamp.Output format :The output displays integers, representing the sorted request timestamps on a single line, separated by spaces.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:2 ≤ n ≤ 250 ≤ timestamp ≤ 100Sample test cases :Input 1 :419 29 12 18Output 1 :12 18 19 29 Input 2 :74 5 6 7 8 9 3 Output 2 :3 4 5 6 7 8 9 Input 3 :510 26 29 28 17Output 3 :10 17 26 28 29

Problem StatementDr. Smith manages a chemistry laboratory where he regularly analyzes the concentration values of various samples. He needs a quick and efficient program to sort the concentration values of 5 different lab samples where each sample is uniquely identified by its floating-point concentration value.To assist Dr. Smith in accomplishing the above task, implement a call-by-reference function called sort for sorting the samples in descending order and display the result.Input format :The input consists of five space-separated floating-point values, representing the concentration of lab samples.Output format :The output prints the sorted concentration values in descending order with two decimal places, separated by spaces.Refer to the sample output for formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:1.00 ≤ Each concentration value ≤ 40.00Sample test cases :Input 1 :34.1 3.4 23.54 1.01 40.0Output 1 :40.00 34.10 23.54 3.40 1.01Input 2 :4.78 5.47 7.42 8.94 7.83Output 2 :8.94 7.83 7.42 5.47 4.78

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.