Merge Sort, Assembly Language

Assignment Help:
Write a program to merge two sorted arrays to create a third sorted array containing all values from the two original arrays.

Merge is a key component to the mergesort algorithm. Suppose we have two sorted array A and B. We want to create array C which contains all values from A and B, in sorted order. Merge looks at one element from each of A and B, and puts the smaller one into array C. When all elements of A or B have been copied into C, the remaining elements from the other array are copied into C.

The pseudocode for merge is:

while more elements in A and more elements in B { if curr element in A < curr element in B copy curr element in A to next position in C else copy curr element in B to next position in C } while more elements in A { copy all remaining elements in A to C } while more elements in B { copy all remaining elements in B to C }

Hint: Think carefully about the subscripts you need for the three arrays.


Prompt the user and read 7 numbers into A. Make sure the values are in order.

Prompt the user and read 5 numbers into B. Make sure the values are in order.

Merge these two arrays to create the array C.

Print the array C.

Related Discussions:- Merge Sort

Modes of 8254-microprocessor, Modes of 8254 :   Mode 0 (Inter...

Modes of 8254 :   Mode 0 (Interrupt on Terminal Count)-GATE which value is 1 enables counting and GATE  which value is 0 disables counting, and GATE put not effect on

Pin functions of 8086-microprocessor, Pin functions for the minimum mode o...

Pin functions for the minimum mode operation of 8086 are following: 1) M/I/O -Memory/IO: This is a status line logically equivalent to S2 in maximum mode. When it is low, it

Memory segmentation-microprocessor, Memory Segmentation : The  memory ...

Memory Segmentation : The  memory in an 8086/8088  based system is organized as segmented memory. In this scheme, the whole physically available memory can be divided into a n

Prime finder - assembly program, Prime Finder - assembly program: Pro...

Prime Finder - assembly program: Problem:  Prime Finder   In this problem you will write a small program that tests whether a given integer is a prime number or not.  Let's

Cryptography, Write a program that allows a user to encrypt/decrypt a mess...

Write a program that allows a user to encrypt/decrypt a message using a shift cipher. The user should specify the key and the message. Your program should be able to handle messa

8237 modes-microprocessor, 8237 modes : Intel 8237 can be set to four d...

8237 modes : Intel 8237 can be set to four different type of style of transfer: 1) Single - One transfer at a time,  it allow processor access to the bus between transfers

Evolution of microprocessor , EVOLUTION OF MICROPROCESSOR : ...

EVOLUTION OF MICROPROCESSOR : The digital circuits and systems may be broken into two part: 1) Sequential Circuit and 2) Combinational Circuits     Norm

Calculator, how to add 111 and 333 in assembly language

how to add 111 and 333 in assembly language

Program to perform one byte bcd addition-assembly program, Program : Write...

Program : Write a program to perform a one byte BCD addition. Solution : It is consider that the operands are in BCD form, but the CPU considers it as hexadecimal and acco

Program to convert decimal to binary number, Program is written but has err...

Program is written but has errors returning values from the procedure.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd