original_docstring: 
          helper function for mergesort
          merges two sorted sequences S1 and S2 into one sorted sequence S
          
docstring: helper function for mergesort
  merges two sorted sequences S1 and S2 into one sorted sequence S
docstring_tokens: helper function for mergesort merges two sorted sequences S1 and S2 into one sorted sequence S
code: def _merge(S1,S2,S):
          '''
          helper function for mergesort
          merges two sorted sequences S1 and S2 into one sorted sequence S
          '''
          i = j = 0
          while i + j < len(S):
              if j == len(S2) or (i < len(S1) and S1[i] < S2[j]):
                  S[i+j] = S1[i]
                  i+=1
              else:
                  S[i+j] = S2[j]
                  j+=1
code_tokens: def _merge ( S1 , S2 , S ) : i = j = 0 while i + j < len ( S ) : if j == len ( S2 ) or ( i < len ( S1 ) and S1 [ i ] < S2 [ j ] ) : S [ i + j ] = S1 [ i ] i += 1 else : S [ i + j ] = S2 [ j ] j += 1
short_docstring: helper function for mergesort
  merges two sorted sequences S1 and S2 into one sorted sequence S
short_docstring_tokens: helper function for mergesort merges two sorted sequences S1 and S2 into one sorted sequence S
comment: '''
          helper function for mergesort
          merges two sorted sequences S1 and S2 into one sorted sequence S
          '''