https://github.com/aayush-bhargav/mips_assembler
This repository consists of an ASM code to implement bubble sort in MIPS architecture. It also contains a python assembler designed to run the ASM code.
https://github.com/aayush-bhargav/mips_assembler
asm assembly-code assembly-language mips-assembly python sorting
Last synced: about 1 month ago
JSON representation
This repository consists of an ASM code to implement bubble sort in MIPS architecture. It also contains a python assembler designed to run the ASM code.
- Host: GitHub
- URL: https://github.com/aayush-bhargav/mips_assembler
- Owner: Aayush-Bhargav
- Created: 2024-04-22T16:03:09.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-04-22T16:16:26.000Z (over 1 year ago)
- Last Synced: 2025-04-02T04:27:06.366Z (6 months ago)
- Topics: asm, assembly-code, assembly-language, mips-assembly, python, sorting
- Language: Python
- Homepage:
- Size: 70.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# MIPS_Assembler
This repository consists of an ASM code to implement bubble sort in MIPS architecture. It also contains a python assembler designed to run the ASM code.
1) Implementation of Sorting algorithm using MIPS(template.asm)
We implemented the bubble sort algorithm to sort the numbers in increasing order.We
stored the variables 'n','n-1','i'(control variable for outer for loop) in different
temporary registers. When 'n'=1,there's no need to enter the loop . So we jump to the
label 'skiploop'. In the outer for loop , we store the starting address of input
values,output values and control variable for inner for loop(j) in other temporary
registers. In the inner for loop, we compare two adjacent elements. If the element at
index a>element at index b(and a