answersLogoWhite

0


Want this question answered?

Be notified when an answer is posted

Add your answer:

Earn +20 pts
Q: How do you write merge sort in Pascal?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Who is best merge sort or insertion sort?

Merge sort is good for large data sets, while insertion sort is good for small data sets.


What is the difference between shell sort and merge sort?

shell uses an odd number,merge uses an even number?


Different types of sorting techniques in c language?

types of sorting in c language are: insertion sort selection sort bubble sort merge sort two way merge sort heap sort quick sort


The easy logic of Merge sort in C?

Top down merge sort is the easy way of merge sort in C language . It is used to derived o(n log n) algorithm . This is in par with the other methods.


Is merge sort external sorting?

Can be. (Meaning: you can merge sorted files without loading them entirely into the main memory.)


Why quick sort better than merge sort?

it has less complexity


How would you sort a linked list?

Use merge sortUse tree sort


Limitations of merge sort and quick sort?

Comolexity Not efficent big data


What is the basic operation in merge sort?

divide and conquer


How do you merge and sort an array using PHP?

To merge and sort an array in PHP you need to use the array_merge() and sort() functions like shown in the example below: <?php $array1 = array(1, 5, 3, 9, 7); $array2 = array(8, 2, 6, 4, 0); // merge the arrays $merge = array_merge($array1, $array2); // 1, 5, 3, 9, 7, 8, 2, 6, 4, 0 // sort the array sort($merge); // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ?>


How do you write a sentence with the word merge?

Please be very careful when you merge with traffic on the expressway.


Which key element will be best for merge sort and why?

There is no key element in a merge sort. Unlike quick sort which requires a key element (a pivot) to recursively divide a subset into two subsets, merge sort simply divides a subset into subsets of 1 element and merges adjacent subsets together to produce sorted subsets. When there is only one subset remaining, the subset is fully sorted.