Scribd Logo
Upload

Welcome to Scribd!

  • Micro dp1

    Uploaded by

    Manreet Dhaliwal
    5 views2 pages
    The document provides code to sort 10 numbers stored from memory location 2200H in ascending order. It initializes a counter, pointer to the memory location, and another counter. It then uses a loop to get each number, increment the pointer, compare the number to the next, and interchange if out of order until the counter reaches 0. The second code provided arranges a set of numbers stored from memory location 2501 in descending order. It loads the number of elements from 2500, initializes a pointer and loop counter. The loop gets each number, increments the pointer, compares to the next, and interchanges if out of order before descending the counter.

    Original Description:

    Original Title

    micro dp1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides code to sort 10 numbers stored from memory location 2200H in ascending order. It initializes a counter, pointer to the memory location, and another counter. It then uses a loop to get each number, increment the pointer, compare the number to the next, and interchange if out of order until the counter reaches 0. The second code provided arranges a set of numbers stored from memory location 2501 in descending order. It loads the number of elements from 2500, initializes a pointer and loop counter. The loop gets each number, increments the pointer, compares to the next, and interchanges if out of order before descending the counter.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views2 pages

    Micro dp1

    Uploaded by

    Manreet Dhaliwal
    The document provides code to sort 10 numbers stored from memory location 2200H in ascending order. It initializes a counter, pointer to the memory location, and another counter. It then uses a loop to get each number, increment the pointer, compare the number to the next, and interchange if out of order until the counter reaches 0. The second code provided arranges a set of numbers stored from memory location 2501 in descending order. It loads the number of elements from 2500, initializes a pointer and loop counter. The loop gets each number, increments the pointer, compares to the next, and interchanges if out of order before descending the counter.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Statement:Write a program to sort given 10 numbers from memory location 2200H in the ascending order Source program: MVI

    B, 09 : Initialize counter START : LXI H, 2200H: Initialize memory pointer MVI C, 09H : Initialize counter 2 BACK: MOV A, M : Get the number INX H : Increment memory pointer CMP M : Compare number with next number JC SKIP : If less, don't interchange JZ SKIP : If equal, don't interchange MOV D, M MOV M, A DCX H MOV M, D INX H : Interchange two numbers SKIP:DCR C : Decrement counter 2 JNZ BACK : If not zero, repeat DCR B : Decrement counter 1 JNZ START HLT : Terminate program execution Arrange a set of numbers in descending order. code:
    LDA 2500 MOV D, A DCR D begin: LXI H, 2501 MOV C, D loop: MOV A, M INX H CMP M JNC ahead MOV B, M DCX H MOV M, B INX H MOV M, A ahead: DCR C JNZ loop DCR D JNZ begin HLT

    note: address location 2500 contains how many numbers there are to be sorted. the numbers are to be stored in address locations 2501 onwards one number per address location. the sorted list will be available after execution in address locations 2501 onwards.

    next: 8085

    You might also like