0
I have a simple integer sorting problem at hand and to solve it, I am planning to write a variation of bubble sort. It seems to be working fine but I am not sure about it's complexity in big-O. What it could be ?
public class TempBubbleSort
{
static Integer[] myArray = {10,9,8,7,6,5,4,3,2,1};
...