Several sorting methods for while and sort

dayDif() {
      var a = [
        3, 11, 19, 14, 9, 19, 43, 432432, 43234, 231, 321321, 323, 54, 546,
      ];
       Least efficient 
      // for (let i = 0; i < a.length; i++) {
      //   for (let j = 0; j < a.length; j++) {
      //     console.log(this.num++, 196);
      //     if (a[j] > a[j + 1]) {
      //       [a[j], a[j + 1]] = [a[j + 1], a[j]];
      //       //console.log(this.num++);
      //     }
      //   }
      // }

       The efficiency is similar to the following 
      // for (let i = a.length - 1; i >= 0; i--) {
      //   // The outer layer controls the number of executions and the inner layer j Maximum 
      //   for (let j = 0; j <= i; j++) {
      //     // Every lying from 0 To j
      //     console.log(this.num++,105);
      //     if (a[j] > a[j + 1]) {
      //       [a[j], a[j + 1]] = [a[j + 1], a[j]];
      //     }
      //   }
      // }

       It's about the same as above 
      // for (let i = 0; i < a.length - 1; i++) {
      //   let indexMin = i;
      //   for (let j = i; j < a.length; j++) {
      //     console.log(this.num++,104);
      //     //  If the current element   Subscript less than the minimum   Update the subscript of the minimum value 
      //     if (a[j] < a[indexMin]) {
      //       indexMin = j;
      //     }
      //   }
      //   //  Avoid exchanging with yourself 
      //   if (indexMin !== i) {
      //     //  Exchange data 
      //     [a[i], a[indexMin]] = [a[indexMin], a[i]];
      //   }
      // }

      // Insertion sort   From the second number , Start to compare   If it's big, go to the back   And so on to the last number 
      for (let i = 1; i < a.length; i++) {
        //  Get the second element 
        const temp = a[i];
        let j = i;
        while (j > 0) {
          console.log(this.num++, 32);
          //  If the current element is smaller than the previous element   Start moving back 
          if (a[j - 1] > temp) {
            a[j] = a[j - 1];
          } else {
            //  Otherwise, it will jump out of the loop 
            break;
          }
          //  Decline 
          j--;
        }
        //  The previous position is assigned to the current element 
        a[j] = temp;
      }

      console.log(a);
    },