human
Merging two unsorted arrays in sorted order | Function to merge array in sorted order.
Sorting a [ ] and b [ ].
Merge two sorted arrays into res [ ].
Merging remaining elements of a [ ] ( if any ).
Merging remaining elements of b [ ] ( if any ).
Driver code.
Final merge list"
Solution in Python:

=====
What is a code to merging two unsorted arrays in sorted order and the other steps required?
assistant
#Here is code to merging two unsorted arrays in sorted order and the other steps required.
 def sortedMerge ( a , b , res , n , m ) :
	a . sort ( )
	b . sort ( )
	i , j , k = 0 , 0 , 0
	while ( i < n and j < m ) :
		if ( a [ i ] <= b [ j ] ) :
			res [ k ] = a [ i ]
			i += 1
			k += 1
		else :
			res [ k ] = b [ j ]
			j += 1
			k += 1
	while ( i < n ) :
		res [ k ] = a [ i ]
		i += 1
		k += 1
	while ( j < m ) :
		res [ k ] = b [ j ]
		j += 1
		k += 1
a = [ 10 , 5 , 15 ]
b = [ 20 , 3 , 2 , 12 ]
n = len ( a )
m = len ( b )
res = [ 0 for i in range ( n + m ) ]
sortedMerge ( a , b , res , n , m )
print " Sorted ▁ merged ▁ list ▁ : "
for i in range ( n + m ) :
	print res [ i ] ,