[Partial Judge]
Given a sequence of integers, sort it in increasing order by implementing the function my_sort().
The main code and the header code are provided as below.
There are two functions defined in the header file:
Function int* readInput() is given. It will read the input numbers, save it into an array, say Seq, and finally return the address of the array.
The first element of array Seq is the number of integers to be sorted. The following elements are the integers.
Function void my_sort(int* B) is the one leaved for you to implement. It take in a single argument B of type int*, whose value is the address of the address of the array Seq.
* Note that the address of the array Seq is returned by the function int* readInput().
* Also, you should be care of the actual type of the variable you want to access to. Do not be confused with the function definition.
* When submitting your code, remember to set Language option to "C: -O2 -lm -std=c99"
A line of N integers seperated by a space in between.
100 <= N <= 1000.
The value of integer falls in the range of [-1000, 1000].
Input is handled by the provided function int* readInput(). You don't need to worry about it.
A line of sorted integers seperated by a space in between. No extra space after the last integer. An newline character ('\n') is appended at the end.
You don't need to worry about it. It is handled in the provided main function.