fn bsort(sort_array :&mut [i32])  {

      let mut sorted  = 1;
      let new_len = sort_array.len();
      while sorted != 0 {
          sorted = 0;
          for i in 0.. new_len - 1 {
              if sort_array[i] > sort_array[i+1] {
                  sort_array[i] += sort_array[i+1];
                  sort_array[i+1] = sort_array[i] - sort_array[i+1];
                  sort_array[i] -= sort_array[i+1];
                  println!("Swap sorted{}", sorted);
                  sorted += 1;
              }
          }
      }
  }