call assembler subrutine from c program , named split(array1 , array2,int size)
***
MUST USE THIS ALGORITHIM :
find the minimum in array1 and maximum in array2
if minimum in array1 > maximum in array2
End
else
exchange the two numbers
***
f.e
long int arr1[6] = {-5, -1, -6, -3, 2, 4};
long int arr2[6] = {1, 3, 5, 6, -4, -2};
split(arr1, arr2, 6);
the subrutine must return the maximum numbers in array1 and the minimum in array2
arr1:
5 1 6 3 2 4
arr2:
-1 -3 -5 -6 -4 -2
Dear client, how are you?
I am a C++ programmer and mathematician.
You task is easy, no problem for me.
Please check my "Profile & Work List" and tell me details if my skill is in your concern.
Looking forward to your response.
Thanks.