<garvit244>41_1.py
def firstMissingPositive( nums):
    index_i = 0
    for index_j in range(len(nums)):
        if nums[index_j] <= 0:
            nums[index_i], nums[index_j] = nums[index_j], nums[index_i]
            index_i += 1
    
    for index in range(index_i, len(nums)):
        if abs(nums[index]) - 1 < len(nums) and nums[abs(nums[index]) - 1] > 0:
            nums[abs(nums[index]) - 1] =  -nums[abs(nums[index]) - 1]
    
    for index in range(nums):
        if nums[index] > 0:
            return index + 1
    return len(nums) + 1
def sample_funcname ( var_0 ) :
    var_2 = 0
    for var_5 in range ( len ( var_0 ) ) :
        if var_0 [ var_5 ] <= 0 :
            var_0 [ var_2 ] , var_0 [ var_5 ] = var_0 [ var_5 ] , var_0 [ var_2 ]
            var_2 += 1
    for var_7 in range ( var_2 , len ( var_0 ) ) :
        if abs ( var_0 [ var_7 ] ) - 1 < len ( var_0 ) and var_0 [ abs ( var_0 [ var_7 ] ) - 1 ] > 0 :
            var_0 [ abs ( var_0 [ var_7 ] ) - 1 ] = - var_0 [ abs ( var_0 [ var_7 ] ) - 1 ]
    for var_7 in range ( var_0 ) :
        if var_0 [ var_7 ] > 0 :
            return var_7 + 1
    return len ( var_0 ) + 1
