I wouldn't recommend this ^^^^ algorithm. That's a Substitution sort with an offset of 1, and also goes out of bounds (off the top) of the array, because of the +1.
I'm sure you meant data[i] > data[i+1], for the comparison and the swap.
If you aren't comparing adjacent elements, it's not a Bubble sort - and it won't b-u-b-b-l-e. (Oh! The horror! LOL ).