C language: how to optimize the sorting of a group by the bubble method?

C language: how to optimize the sorting of a group by the bubble method?

# Define _ CRT_SECURE_NO_WARNINGS 1 # include <stdio. h> # include <stdlib. h> int main () {int arr [] = {5, 6, 7, 8, 9, 1, 2, 3, 4}; int I = 0; int j = 0; int flag; int size = sizeof (arr)/sizeof (arr [0]); for (I = 0; I <size-1; I ++) {flag = 1; // set the flag to optimize the bubble for (j = 0; j <size-1-I; j ++) {if (arr [j] <arr [j + 1]) {int tmp = arr [j]; arr [j] = arr [j + 1]; arr [j + 1] = tmp; flag = 0 ;}} if (flag) // indicates that it is not in the if internal state, that is, it has not been exchanged as the required output sequence break ;} for (I = 0; I <size; I ++) {printf ("% d", arr [I]) ;}system ("pause"); return 0 ;}