Where are the comparisons and swaps being done in this sorting algorithm? for fillslot in range(len(alist) - 1, 0 , -1):
positionOfMax = 0
for location in range(1, fillslot + 1):

if alist[location] > alist[positionOfMax]:
positionOfMax = location

temp = alist[fillslot]
alist[fillslot] = alist[positionOfMax]
alist[positionOfMax] = temp

I dont know

Explanation:

the major difference between the two is the objective and the reward of the game. candy crush has a puzzle theme with the objective of meeting a specific quota of points or objects, you are able to gain access to the next level and compete with peers on the process. on duolingo the objective is rather different, you are given sets of questions for you to answer for you to move to the next level and as for the reward, you are able to learn available language as this is an app developed to teach the user about other languages.