Question: [7 points] Write a program to sort a list of ntegers in ascending order, and determine its median. Assume that the number of integers to
[7 points] Write a program to sort a list of ntegers in ascending order, and determine its median. Assume that the number of integers to be sorted is given as user given input. I. 2. [10 points] Write a program to print the stars sequence: *4 Assume that there is a blank line between the individual lines containing the stars. You must use loops to solve this problem rather than merely printing the characters without using loops 3. [6 points] Write a program to print all the 26 characters (both small and big case) in the English alphabet set in both decimal and character form. [8 points] Write a program using functions which computes (a) x raised to the power y and (b) y raised to the power x, when both x and y are provided as double precision inputs. You must not use the pow(.) function of C. Rather, you must write a user define function named power which accepts x and y as input and returns a double precision output 4. 5. [5 points] Write a program to compute and display the multiplication table of a given positive integer. The table must display the multiplication table up to 10. 6. [6 points] Write a program using functions which checks if two input integers are equal without using relational/equality/arithmetic operators. The program should display "Two numbers are equal!" or "Two numbers are unequal!" as the case may be. 7. [6 points] Write a program to display the series 1 +3+6+10+15 +... + n where n is any user given positive integer input which can be a member of this series. Provide an appropriate value for n such that the sum is displayed correctly within the range of numbers your PC can handle. You must not merely add these numbers without using loops. 8. [2 points] Write a program to compute the maximum and minimum of two integers withou using any comparison operator or selection statements or loops
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
