Answer:
n := length(A)
repeat
swapped := false
for i := 1 to n-1 inclusive do
<em> /* if this pair is out of order */</em>
if A[i-1] > A[i] then
<em> /* swap them and remember something changed */</em>
swap(A[i-1], A[i])
swapped := true
end if ⇒
end for
until not swapped
end procedure
Explanation:
This is pseudocode
Answer:
Explanation:
The following code is written in Python. It creates a method for each one of the questions asked and then tests all three with the same test case which can be seen in the picture attached below.
def alternating_list(lst1, lst2):
lst3 = []
for x in range(len(lst1)):
lst3.append(lst1[x])
try:
lst3.append(lst2[x])
except:
pass
if len(lst2) > len(lst1):
lst3.extend(lst2[len(lst1):])
return lst3
def reverse_alternating(lst1, lst2):
lst3 = []
if len(lst1) == len(lst2):
for x in range(len(lst1) - 1, -1, -1):
lst3.append(lst1[x])
lst3.append(lst2[x])
return lst3
def alternating_list_no_extra(lst1, lst2):
lst3 = []
max = 0
if len(lst1) > len(lst2):
max = len(lst2)
else:
max = len(lst1)
for x in range(max):
lst3.append(lst1[x])
try:
lst3.append(lst2[x])
except:
pass
return lst3
