Drag and drop the lines into the box on the right. The constructed function should bubble the highest number to the end index and repeat for the second highest to end -1 etc, until the list is sorted. This is an inefficient simplified version. Go back to the algorithms for a more optimised version, but be aware that no bubble sort will ever be efficient enough to use on a large data set. That's what quick sort and merge sort are for.
Indentation matters, and there may be a line / lines that you shouldn't include.