Write 8085 program on bubble sort algorithm?

Answer 1

The basic algorithm for a bubble sort requires a boolean indicator. As the program cycles through the array to be sorted, it steps by one and compares n and n+1. If n+1 is greater than n, then they are swapped, the boolean indicator is set to false and the comparator increments by one. Once the comparator makes a complete cycle through without the indicator flagging to false, the array is sorted.

Answer 2

Program for bubble sort for integer array:

#include<stdio.h>

void main()

{

int i,j,k,temp;

printf("Enter the length of array:");

scanf("%d",&i);

int a[i];//Array declaration

printf("Enter the no:\n");

for(j=0;j<i;j++)//data insertion in array

{

scanf("%d"&a[j]);

}

//bubble sort

for(k=0;k<(i-1);k++)

{

for(j=0;j<(i-1)-k;j++)

{

if(a[j]>a[j+1])

{

temp=a[j];

a[j]=a[j+1];

a[j+1]=temp;

}

}

}

//show the sorted data

printf("Thee sorted array is:\n");

for(int j=0;j<i;j++)

{

printf("%d",a[j]);

}

}

Answer 3

1

2

3

4

5

6

7

8

9

10

1

12

13

14

15

16

17

18

19

20

21

22

mvi b,03h

start: lxi h,var1

mvi c,03h

back: mov a,m

inx h

cmp m

jc ahead

mov d,m

mov m,a

dcx h

mov m,d

inx h

ahead: dcr c

jnz back

dcr b

jnz start

hlt