Question

python

Question 7: Give a recursive implement to the following function: def split_by_sign (lst, low, high) The function is given a list 1st of non-zero integers, and two indices: low and high (low Shigh), which indicate the range of indices that need to be considered. The function should reorder the elements in Ist, so that all the negative numbers would come before all the positive numbers. Note: The order in which the negative elements are at the end, and the order in which the positive are at the end, doesn't matter, as long as all he negative are before all the positive.

Answer 1

Screenshot of the code used:

Bocowawy Dw N Lo segregate.py def split_by_sign (1st, low, high): if low < high: if 1st[low] > 0 and 1st[high] < 0: # if value at low is greater than zero and value at high is less than zero. temp = lst[high] # we swap the two elements lst[high] = lst[low] lst[low] = temp split_by_sign(1st, low + 1, high - 1) # next we recursively call the split_by_sign() method. elif 1st[low] > 0: # if value at high is greater than zero. split by sign(1st, low, high - 1) # we just decrement high by one and value the split by sign() method. else: split_by_sign(1st, low + 1, high) # if the low is less than zero |

The code used:

def split_by_sign(lst, low, high):
    if low < high:
        if lst[low] > 0 and lst[high] < 0:  # if value at low is greater than zero and value at high is less than zero.
            temp = lst[high]  # we swap the two elements
            lst[high] = lst[low]
            lst[low] = temp
            split_by_sign(lst, low + 1, high - 1)  # next we recursively call the split_by_sign() method.
        elif lst[low] > 0:  # if value at high is greater than zero.
            split_by_sign(lst, low, high - 1)   # we just decrement high by one and value the split_by_sign() method.
        else:
            split_by_sign(lst, low + 1, high)  # if the low is less than zero

I hope you like the solution. In case of any doubts regarding the solution feel free to ask it in the comment section. If you like the solution please give a thumbs up.

Answer 2

semensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemensemen