bubble sort python

Question

Information to solve question:

Use "a" for loop to calculate the sum of squares of values in this list: 1, 7, 8, 6, 11. (The answer should be 271)

Create a recursive function to do the same calculation a in the previous question. (The function input will be the list. Each recursion, you are going to send a sub-list with one less item from the list).

(question to answer)

(1) Create a function to perform bubble sorting (in python language) as descried in this tutorial: https://www.geeksforgeeks.org/bubble-sort/ . The algorithm should stop when there are no swaps in the last iteration

Answer 1

#-------------------------------------------------

#sum of squares recursively

def SumOfSquares(x):

if len(x)>0:

return x[0]*x[0]+SumOfSquares(x[1:])

else:

return 0

#-------------------------------------

#BubbleSort

def BubbleSort(array,N):

while (int(N)>0):

for j in range(int(N-1)):

if float(array[j]) >float(array[j+1]):

temp = array[j+1]

array[j+1]=array[j]

array[j]=temp

N=int(N)-1

return(array)

x=[1,7,8,6,11]

sumOfSquares = SumOfSquares(x)

print(sumOfSquares)

array=[10,5,3,7,9,2,6,8,1,4]

print(BubbleSort(array,10))