MindReadGame/sort.asm at master · eini122/MindReadGame · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
.data
space: .asciiz " "
testList:	.space 32
newLine: .asciiz "\n"
.text
main:
	#store 32 numbers
	addi $t2, $t2, 32
	add $t3, $t3, $zero
	jal setNumber
	#print 32 number before sort
	lbu $t1, testList
	addi $t2, $t2, 1
	jal printList

	li $v0, 4
	la $a0, newLine
	syscall

	#BubbleSort
	la $a0, testList
	jal insertionSort
	addi $t2,$zero,1
	lbu $t1, testList
	jal printList

	#program end
	li $v0, 10
	syscall
printList:
	li $v0, 1
	move $a0, $t1
	syscall

	li $v0, 4
	la $a0, space
	syscall

	lb $t1, testList($t2)
	addi $t2, $t2, 1
	bne $t2, 33, printList
	jr $ra


setNumber:
	sb $t2, testList($t3)
	subi $t2, $t2, 1
	addi $t3, $t3, 1
	bne $t3, 32, setNumber
	jr $ra
#	$a0: address of array
#	$t0: i
#	$t1: j
#	$t2: j+1
#	$t3: temp
#	$t4: array[j]
#	$t5: array[j+1]
#	$t6: get address of array
insertionSort:
	li $t0, 1 #set i = 1
	j endLoop1
forLoop1:
	lb $t3, testList($t0) #temp = arr[i]
	addi $t1, $t0, -1
	j next
	forLoop2:
		add $t6, $a0, $t1	#get address of array[i]
		lb $t4, ($t6) #array[j]
		addi $t2, $t1, 1 #j+1
		add $t6, $a0, $t2	#get address of array[j+1]
		sb $t4, ($t6) #store array[j] to array[j+1]
		addi $t1, $t1, -1 #j--

	next:
		blt $t1, $zero, endLoop2 #if j = 0, end loop2
		add $t6, $a0, $t1	#set address of array[j]
		lb $t4, ($t6) #Array[j]
		bgt $t4, $t3, forLoop2 #if temp < array[j] , startloop 2

	endLoop2:
		addi $t5, $t1, 1
		add $t6, $a0, $t5
		sb $t3, ($t6)
		addi $t0, $t0, 1 #i++
endLoop1:
	blt $t0, 32, forLoop1
	jr $ra