Is bubble sort done correctly?

Question

C++ / C#

Good afternoon! tell me if I did the sorting correctly?

#include <iostream>

using namespace std;

int main(){
  const int N = 9;
  int mass[N]={0,1000,401,-98,7,110,9,1332,0};
  
  for (int i=0;i<N;i++){
    for (int j=0;j<N-1;j++){
      if (mass[i]<mass[j]){
        double temp = mass[i];
        mass[i]=mass[j];
        mass[j]=temp;
      }
    }
  }
  for (int i=0;i<9;i++){
    cout<<mass[i]<<"\n";
  }
  return 0;
}

Answer 1

Not quite right, but it's similar to bubble sort or simple exchange sort.

for (int i = 0; i < N; i++) {
    for (int j = N - 1; j > i; j--) {
        if (mass[j - 1] > mass[j]) {
            double temp = mass[j];
            mass[j] = mass[j - 1];
            mass[j - 1] = temp;
        }
    }
}

For example, insertion sort:

for (int i = 1; i < N; i++) {
    for (int j = i; j > 0 && mass[j - 1] > mass[j]; j--) {
        double temp = mass[j];
        mass[j] = mass[j - 1];
        mass[j - 1] = temp;
    }
}