Answers for "which is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order."

which is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

ggggxgb n

bubble sort integers

for (int i = 0; i < n-1; i++) 
            for (int j = 0; j < n-i-1; j++) 
                if (arr[j] > arr[j+1]) 
                { 
                    // swap arr[j+1] and arr[i] 
                    int temp = arr[j]; 
                    arr[j] = arr[j+1]; 
                    arr[j+1] = temp; 
                }