COMP1036 Coursework Part II (25 marks)
Tasks
Write a program in Hack Assembly Language that sorts an array of integers in ascending or descending order. The unsorted array contains 5 or more elements, located at a range of memory locations starting from RAM[50]. The integers in the array can be positive, negative, or zero.
The program should allow you to sort either the entire array or a portion of it. The number of elements to be sorted is determined by the integers stored in RAM[0] and RAM[1], as described below:
Read two input values,X andY, from RAM[0] and RAM[1], respectively, and output the computed result, Z, to RAM[2]. X and Y can be positive or negative. The program should function correctly regardless of whether X < Y, X > Y, or X = Y.
Different rules will be applied based on whether X and Y are even or odd integers, as follows:
(1) IF both X and Y are even integers, THEN Z is the sum of all even integers between X and Y (inclusive).
(2) IF both X and Y are odd integers, THEN Z is the sum of all odd integers between X and Y (inclusive).
(3) IF one of X or Y is odd and the other is even, THEN Z is the sum of all integers between X and Y (inclusive).
(4) IF X = Y, THEN Z = X or Z = Y.
(5) IF Z is positive, THEN sort the array in ascending order.
(6) IF Z is negative, THEN sort the array in descending order.
(7) IF Z is zero, THEN no sorting should be done.
Example 1:
Given RAM[0] = X = -4; RAM[1] = Y = 2
The range of integers between X and Y (inclusive) is [-4, -3, -2, -1, 0, 1, 2].
Applying Rule (1): RAM[2] = Z = (-4) + (-2) + 0 + 2 = -4.
Applying Rule (6) for Z = -4: Sort the first 4 elements of the array in descending order.
Example 2:
Given RAM[0] = X = -5; RAM[1] = Y = 5
The range of integers between X and Y (inclusive) is [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5].
Applying Rule (2): RAM[2] = Z = (-5) + (-3) + (-1) + 1 + 3 + 5 = 0.
Applying Rule (7) for Z = 0: No sorting should be done.
Example 3:
Given RAM[0] = X = 2; RAM[1] = Y = 3
The range of integers between X and Y (inclusive) is [2, 3].
Applying Rule (3): RAM[2] = Z = 2 + 3 = 5.
Applying Rule (5) for Z = 5: Sort the first 5 elements of the array in ascending order.
Example 4:
Given RAM[0] = X = 3; RAM[1] = Y = 3
The range of integers between X and Y (inclusive) is [3].
Applying Rule (4): RAM[2] = Z = 3.
Applying Rule (5) for Z = 3: Sort the first 3 elements of the array in ascending order.
Some Input and Output Examples:
|
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
In
|
Out
|
|
RAM[0]
|
1
|
|
-2
|
|
2
|
|
-4
|
|
-3
|
|
-4
|
|
-5
|
|
-5
|
|
3
|
|
5
|
|
|
RAM[1]
|
1
|
|
3
|
|
3
|
|
2
|
|
-2
|
|
5
|
|
4
|
|
5
|
|
3
|
|
-4
|
|
|
RAM[2]
|
|
1
|
|
3
|
|
5
|
|
-4
|
|
-5
|
|
5
|
|
-5
|
|
0
|
|
3
|
|
5
|
|
Ignore the values in RAM[3], RAM[4], …, RAM[49]
|
|
RAM[50]
|
3
|
3
|
3
|
2
|
3
|
1
|
3
|
5
|
3
|
5
|
-3
|
-5
|
-3
|
-1
|
3
|
3
|
3
|
2
|
-3
|
-5
|
|
RAM[51]
|
2
|
2
|
2
|
3
|
2
|
2
|
2
|
3
|
2
|
4
|
-2
|
-4
|
-2
|
-2
|
2
|
2
|
2
|
3
|
-2
|
-4
|
|
RAM[52]
|
5
|
5
|
5
|
5
|
5
|
3
|
5
|
2
|
5
|
3
|
-5
|
-3
|
-5
|
-3
|
5
|
5
|
5
|
5
|
-5
|
-3
|
|
RAM[53]
|
1
|
1
|
1
|
1
|
1
|
4
|
1
|
1
|
1
|
2
|
-1
|
-2
|
-1
|
-4
|
1
|
1
|
1
|
1
|
-1
|
-2
|
|
RAM[54]
|
4
|
4
|
4
|
4
|
4
|
5
|
4
|
4
|
4
|
1
|
-4
|
-1
|
-4
|
-5
|
4
|
4
|
4
|
4
|
-4
|
-1
|
Requirements
1. RAM[0] and RAM[1] are reserved for holding the two input values, X and Y, respectively.
2. RAM[2] is reserved for the value Z, which is the number of elements in the array to be sorted. This value is computed from the integers stored in RAM[0] and RAM[1].
3. RAM[50] onwards are reserved for holding the array integers before sorting, as well as the results after sorting.
4. Sample testcases are provided to evaluate your program, but the final testcases will be different from the sample test cases.
5. You should use the sample test file to evaluate your program. Your program will be finally evaluated using a similar test file. Failure to comply with the test file format may result in your program failing the final test cases.
6. You should anticipate that the size of the array in the final test cases may vary and could be larger or smaller than 5. However, you do not need to be concerned about scenarios where the value Z in RAM[2] exceeds the size of the array in a given test case.
7. Ensure that your program is bug-free. A zero mark will be immediately given to non-executable code.
8. You should complete all tasks in one assembly file. Name your assembly file “main.asm” .
Marking Criteria
1. 25 marks in total.
2. 20 test cases will be used, each test case carrying one mark.
3. Your program should be well-structured and thoroughly documented. A total of 5 marks will be awarded for the effective use of pseudocode, built-in symbols, labels, variables, comments, and indentation.
4. The efficiency of your program will also be considered. A limited number of tick-tocks will be given for each test case. If your program does not generate the expected results within the given number of tick-tocks, you will lose one mark for that test case.