|
|
algorithm for merge sort - Algorithm
|
Views : 204
|
|
Tagged in : Algorithm
|
|
|
Report This Scrap as Inappropriate
We request you to choose the appropriate categroy and subcategory that suits your
objectionable concern about the scrap, So that our team can review and find out whether it violates our Guidelines or the
scrap is not suitable for all viewers.
|
function merge_sort(m)
if length(m) ⤠1
return m
var list left, right, result
var integer middle = length(m) / 2
for each x in m up to middle
add x to left
for each x in m after middle
add x to right
left = merge_sort(left)
right = merge_sort(right)
if left.last_item > right.first_item
result = merge(left, right)
else
result = append(left, right)
return result
|
|
By gowtham, On - 2010-02-03 |
|
|
|
