Give a way to optimise a bubble sort algotihm

The inner loop takes into account that after each pass the last non sorted index place is sorted so there's no need to loop ​to that point again Also a recognistion (through a variable called swapped maybe) of when the algrothm has sorted the problem so no unnecessary additional passing through is done