Assignment Write RISC-V assembly code for bubble sort (without function calling). Assume that arr[5] = {6, 1, 3, 2, 7); starting at memory address 0x10000000. Pseudocode for bubble sort procedure bubbleSort (list: array of items) loop list.count; for i = 0 to loop-1 do: swapped false = for j = 0 to loop-1 do: /* compare the adjacent elements */ if list[j] > list[j+1] then /* swap them */ swap(list[i], list[j+1] ) swapped true end if end for /*if no number was swapped that means array is sorted now, break the loop. */ if (not swapped) then break end if
Assignment Write RISC-V assembly code for bubble sort (without function calling). Assume that arr[5] = {6, 1, 3, 2, 7); starting at memory address 0x10000000. Pseudocode for bubble sort procedure bubbleSort (list: array of items) loop list.count; for i = 0 to loop-1 do: swapped false = for j = 0 to loop-1 do: /* compare the adjacent elements */ if list[j] > list[j+1] then /* swap them */ swap(list[i], list[j+1] ) swapped true end if end for /*if no number was swapped that means array is sorted now, break the loop. */ if (not swapped) then break end if
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![Assignment
Write RISC-V assembly code for bubble sort (without function calling).
Assume that arr[5] = {6, 1, 3, 2, 7); starting at memory address 0x10000000.
Pseudocode for bubble sort
procedure bubbleSort( list: array of items)
loop list.count;
for i=0 to loop-1 do:
swapped false
for j = 0 to loop-1 do:
/* compare the adjacent elements */
if list[j] > list[j+1] then
/* swap them */
end if
end for
/*if no number was swapped that means
array is sorted now, break the loop. */
swap list [j], list[j+1] )
swapped true
if (not swapped) then
break
end if
end for
end procedure return list
Note that you will have to write 2 loops
Copy this starter code and continue writing your code in your .s file:
#arr = {6, 1, 3, 2, 7)
LI a0, 0x10000000 # start address
LI a2, 6
SB a2,0 (a0)
LI a2, 1
SB a2,4 (20)
LI a2, 3
SB a2, 8 (80)
LI a2, 2
SB a2, 12 (20)
LI a2, 7
SB a2, 16 (20)
#BEGIN YOUR CODE HERE](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F17fb7c04-187c-4763-b6c5-1b444cd4b1ad%2Fac7442c0-2b8f-4d77-b9c9-7412f5b6fee9%2Fy140bdh_processed.png&w=3840&q=75)
Transcribed Image Text:Assignment
Write RISC-V assembly code for bubble sort (without function calling).
Assume that arr[5] = {6, 1, 3, 2, 7); starting at memory address 0x10000000.
Pseudocode for bubble sort
procedure bubbleSort( list: array of items)
loop list.count;
for i=0 to loop-1 do:
swapped false
for j = 0 to loop-1 do:
/* compare the adjacent elements */
if list[j] > list[j+1] then
/* swap them */
end if
end for
/*if no number was swapped that means
array is sorted now, break the loop. */
swap list [j], list[j+1] )
swapped true
if (not swapped) then
break
end if
end for
end procedure return list
Note that you will have to write 2 loops
Copy this starter code and continue writing your code in your .s file:
#arr = {6, 1, 3, 2, 7)
LI a0, 0x10000000 # start address
LI a2, 6
SB a2,0 (a0)
LI a2, 1
SB a2,4 (20)
LI a2, 3
SB a2, 8 (80)
LI a2, 2
SB a2, 12 (20)
LI a2, 7
SB a2, 16 (20)
#BEGIN YOUR CODE HERE
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education