human
Lexicographically largest possible by merging two strings by adding one character at a time | Recursive function for finding the lexicographically largest string.
If either of the string length is 0 , return the other string.
If s1 is lexicographically larger than s2.
Take first character of s1 and call the function.
Take first character of s2 and recursively call function for remaining string.
Driver code.
Given Input.
Function call"
How can the above be solved in Python?

What is a code to lexicographically largest possible by merging two strings by adding one character at a time and the other steps required?
assistant
#Here is code to lexicographically largest possible by merging two strings by adding one character at a time and the other steps required.
 def largestMerge ( s1 , s2 ) :
	if len ( s1 ) == 0 or len ( s2 ) == 0 :
		return s1 + s2
	if ( s1 > s2 ) :
		return s1 [ 0 ] + largestMerge ( s1 [ 1 : ] , s2 )
	return s2 [ 0 ] + largestMerge ( s1 , s2 [ 1 : ] )
if __name__ == ' _ _ main _ _ ' :
	s1 = " geeks "
	s2 = " forgeeks "
	print ( largestMerge ( s1 , s2 ) )