Question

In python, create another version called Switch-BubbleSort that combines the tradition BubbleSort and AltBubbleSort. That is, it alternates between finding the largest element and pushing it to the end of the list is one iteration and then finding the smallest element and pushing it to the beginning of the list in the next iteration and goes back and forth until the entire list is sorted, which is then returned.

Answer 1

The executable code for the given problem is:

def bub_sort(array):
    n = len(array)
    switch=0

    # Traversing array elements
    for i in range(n):

        # for even numbered iterations i have placed max number at last
    #here in each iteration elements are sorted by using one case(even case
        #or odd case).
    
        if(i %2==0):
           for j in range(int(i/2), n-int(i/2)-1):
              if array[j] > array[j+1] :
                array[j], array[j+1] = array[j+1], array[j]#swapping
       # for odd numbered iterations i have placed min number at the beginning
        else:
           for j in range(n-int(i/2)-1,int(i/2) ,-1):
              if array[j] < array[j-1] :
                 array[j], array[j-1] = array[j-1], array[j]#swapping
          

#initializing array
array = [1,4,2,3,8,8,1,53,23,45,28,21]
#calling bubble sort function
bub_sort(array)

print ("After sorting the array will be: is:")
for i in array:
    print (i)

program alignment :

sample output for the given code is: