Write a Console Java program to implement the following Sorting Program. Generate 20 random integers in the range of 10 to 100 and place them in an array. Sort the array in ascending order using the logic below and output both the unsorted and sorted arrays (each on a new line) on the Console separating the numbers with spaces.
The technique for this sorting program uses nested loops to make several passes through the array. Each pass compares successive pairs of elements. If the pair is in increasing order or equal leave the value as they are. If the pair is in decreasing order (i. e 2nd value is smaller than the 1st) swap the two values. First compare the first two elements and swap if needed. Then compare 2nd and 3rd elements and swap if needed. Proceed this way until you reach the end of the array. This will place the largest element at the end.
Repeat this process again. After two passes two largest numbers will be at the end. Continue until all the elements are sorted.

Write a loop that reads positive integers from standard input and that terminates when it reads an integer that is not positive. after the loop terminates, it prints out, on a line by itself and separated by spaces, the sum of all the even integers read, the sum of all the odd integers read, a count of the number of even integers read, and a count of the number of odd integers read, all separated by at least one space. declare any variables that are needed. assume the availability of a variable, stdin, that references a scanner object associated with standard input. that is, stdin = new scanner(system. in); is given.

Awell-diversified portfolio needs about 20-25 stocks from different categories.

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e. g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)