Scribd
Upload
459 views

Sort Array in Descending Order

This program sorts an array of numbers in descending order using an 8085 microprocessor. It initializes counters to the array size and points to the starting memory address. It then compares each number to the next and swaps if out of order, decrementing counters after each iteration. This continues until the entire array is sorted from highest to lowest value.

Uploaded by

NishantSinha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
459 views

Sort Array in Descending Order

This program sorts an array of numbers in descending order using an 8085 microprocessor. It initializes counters to the array size and points to the starting memory address. It then compares each number to the next and swaps if out of order, decrementing counters after each iteration. This continues until the entire array is sorted from highest to lowest value.

Uploaded by

NishantSinha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

8085 Programs

Gursharan Singh Tatla Page 1 of 3


Program 26: Sort the array in descending order.

Flowchart:































Stop
Start
Initialize counter-1.
Initialize counter-2 and H-L pair.
Move the number from memory
to accumulator.
Increment H-L pair to point to
next numbers memory location.
Decrement counter-1.
Is
A > M?
Increment H-L pair.
No
Yes
Compare number in memory
with number in accumulator.
Interchange the numbers.
Decrement counter-2.
Is
counter-1 = 0?
No
No
Yes
Yes
Is
counter-2 = 0?
8085 Programs

Gursharan Singh Tatla Page 2 of 3
Program:
Address Mnemonics Operand Opcode Remarks
2000 MVI B, 05H 06 Initialize counter-1.
2001 05 Immediate value 05H.
2002 MVI C, 05H 0E Initialize counter-2.
2003 05 Immediate value 05H.
2004 LXI H, 3000H 21 Load H-L pair with address 3000H.
2005 00 Lower-order of 3000H.
2006 30 Higher-order of 3000H.
2007 MOV A, M 7E Move the number from memory to reg. A.
2008 INX H 23 Increment H-L pair.
2009 CMP M BD Compare the number with next number.
200A JNC 2015H D2 Dont interchange if number > next number.
200B 15 Lower-order of 2015H.
200C 20 Higher-order of 2015H.
200D JZ 2015H CA Dont interchange if number = next number.
200E 15 Lower-order of 2015H.
200F 20 Higher-order of 2015H.
2010 MOV D, M 56
Otherwise, swap the numbers. Move next
number from memory to D.
2011 MOV M, A 77 Move first number from A to memory.
2012 DCX H 2B Decrement H-L pair.
2013 MOV M, D 72 Move next number from D to memory.
2014 INX H 23 Increment H-L pair.
2015 DCR C 0D Decrement counter 2.
2016 JNZ 2007H C2 If counter-2 0, repeat.
2017 07 Lower-order of 2007H.
2018 20 Higher-order of 2007H.
2019 DCR B 05 Decrement counter-1.
201A JNZ 2002 C2 If counter-1 0, repeat.
201B 02 Lower-order of 2002H.
201C 20 Higher-order of 2002H.
201D HLT 76 Halt.




8085 Programs

Gursharan Singh Tatla Page 3 of 3
Explanation:
This program sorts an array in descending order.
Let us assume that there are five numbers in the array and its starting address is 3000H.
Initially, counter-1 and counter-2 are initialized with the size of the array.
H-L pair is pointed to the starting address of the array.
In the first iteration, first number is compared with the second number.
If first number > second number, then do not interchange them. Otherwise, if first number <
second number, then swap them.
In the next iteration, first number is compared with the third number.
If first number > third number, then do not interchange them. Otherwise, if first number <
third number, then swap them.
In the next iteration, first number is compared with the fourth number and the process
continues until counter-2 becomes zero.
When counter-2 becomes zero, counter-1 is decremented and the process continues until all
the numbers are arranged in descending order.

Output:
Before Execution: After Execution:
3000H: 05H 3000H: 65H
3001H: 15H 3001H: 32H
3002H: 01H 3002H: 15H
3003H: 65H 3003H: 05H
3004H: 32H 3004H: 01H

You might also like