Big O for recursive Bubble Sort

Question

Hey everyone,

I was just wondering if someone could help me find out what the Big O complexity would be for a recursive bubble sort. The sort would essentially move forward until a swap and move back as far as it needs to then move forward again. If anyone knows this please let me know. Also I can attach code mock up if needed but hopefully this makes enough sense as is

Answer 1

Can you attach the code also ?