Analyze the following sorting algorithm

Analyze the following sorting algorithm: for (int i = o; i < SIZE; i++) if (list [i] > list [i + 1]) swap list [i] with list [i + 1] ;