Below is the flow diagram of the Selection Sort algorithm. The array elements are listed in the sample table below according to the flow chart above. According to this information; a) Calculating the average value of array elements and assigning it to the avg variable, b) Implementing the Selective Sorting algorithm in assembly language with the option a Write the code in the blank space below, explain the code. n= 10 (Number of elements of array a) a[10] = { 32, 16, 64, 128, 2, 8, 0, 4, 1, 3 } Answer: MY_DATA SEGMENT PARA 'DATA' n DB 10 a DB 32, 16, 64, 128, 2, 8, 0, 4, 1, 3 ort DW ? MY_DATA ENDS MY_CODE SEGMENT PARA 'CODE' MY_PROG PROC FAR ASSUME CS:MY_CODE, DS:MY_DATA MOV AX,MY_DATA MOV DS,AX .......... MOV AH, 04CH INT 21H RET MY_PROG ENDP MY_CODE ENDS END MY_PROG

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Below is the flow diagram of the Selection Sort algorithm.

The array elements are listed in the sample table below according to the flow chart above.

According to this information;
a) Calculating the average value of array elements and assigning it to the avg variable,
b) Implementing the Selective Sorting algorithm in assembly language with the option a
Write the code in the blank space below, explain the code.

n= 10 (Number of elements of array a)

a[10] = { 32, 16, 64, 128, 2, 8, 0, 4, 1, 3 }

Answer:

MY_DATA SEGMENT PARA 'DATA'

n DB 10

a DB 32, 16, 64, 128, 2, 8, 0, 4, 1, 3

ort DW ?

MY_DATA ENDS

MY_CODE SEGMENT PARA 'CODE'

MY_PROG PROC FAR

ASSUME CS:MY_CODE, DS:MY_DATA

MOV AX,MY_DATA

MOV DS,AX

..........

MOV AH, 04CH

INT 21H

RET

MY_PROG ENDP

MY_CODE ENDS

END MY_PROG

min
32 16
8 0
4 1 3
64
128
2
min
[16
64
128
2
8 32 4
3.
64 128
2
8 32 4
16 3
128
64 8 32 4
16| 3
1
64
8 32 4
16
128
1
2
4
8 32 64
16
128
1
2
4
8
32
64 16 128
1
4
8
16
64
32
128
1
2
3
4
8
16
32
64
128
3,
3.
3.
3.
3.
2.
Transcribed Image Text:min 32 16 8 0 4 1 3 64 128 2 min [16 64 128 2 8 32 4 3. 64 128 2 8 32 4 16 3 128 64 8 32 4 16| 3 1 64 8 32 4 16 128 1 2 4 8 32 64 16 128 1 2 4 8 32 64 16 128 1 4 8 16 64 32 128 1 2 3 4 8 16 32 64 128 3, 3. 3. 3. 3. 2.
yes
'MIN =
Exchange
a(i) and a(lMin)
End
Transcribed Image Text:yes 'MIN = Exchange a(i) and a(lMin) End
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY