Cocktail sort

void sort(int arr[], int len) { bool flag = true; int temp; while(flag) { flag = false; int bottom = 0; int top = len - 1; int i; for(i=bottom; i < top; ++i) { if (arr[i] > arr[i+1]) { temp = arr[i]; arr[i] = arr[i+1]; arr[i+1] = temp; flag = true; } } --top; int j; for(j=top; j > bottom; --j) { if (arr[j] < arr[j-1]) { temp = arr[j]; arr[j] = arr[j-1]; arr[j-1] = temp; flag = true; } } ++bottom; } }