Данный отчёт сгенерирован 10.02.2023 18:21:31 UTC.
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
Задача: Сортування Бульбашкою
10.02.2023 18:21:31
Описание: Запрограмувати алгоритм сортування бульбашкою у вигляді функції bubbleSort(arr),
яка нічого не повертає, але впорядковує переданий їй масив.
Сортувати за зростанням.
Не використовувати метод sort.
10.02.2023 18:21:31
Решений: 44
10.02.2023 18:21:31
Сортування Бульбашкою
10.02.2023 18:21:31
function bubbleSort(arr){
for (let j = arr.length - 1; j > 0; j--) {
for (let i = 0; i < j; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
}
function bubbleSort(array) {
let bu = array.length - 1;
while (bu >= 1) {
for (let i = 0; i < bu; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bu--;
}
return array;
}
function bubbleSort(arr){
let temp = 0
let flag = true
let counter = 0
while(flag){
for(let i = 0; i< arr.length;i++){
if(arr[i]>arr[i+1]){
temp = arr[i+1]
arr.splice(i+1,1,arr[i])
arr.splice(i,1,temp)
temp = 0
counter++
}
}
if(counter == 0) flag = false
else counter = 0
}
}
function bubbleSort(array){
buffer = 0;
for(let i = 0; i < array.length-1; i++){
for(let j = 0; j < array.length-1; j++){
if (array[j] > array[j+1]){
buffer = array[j];
array[j] = array[j+1];
array[j+1] = buffer;
}
}
}
}
function bubbleSort(arr)
{
for(i=0; i< arr.length-1; i++)
{
for(j=i+1; j< arr.length;j++)
{
if(arr[i]>arr[j])
{
let temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
}
}
}
}
function bubbleSort(arr) {
for (var i = 0, endI = arr.length - 1; i < endI; i++) {
for (var j = 0, endJ = endI - i; j < endJ; j++) {
if (arr[j] > arr[j + 1]) {
var swap = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = swap;
}
}
}
return arr;
}
function bubbleSort(arr){
done = 0
while (done < arr.length) {
for(let index = 0; index < arr.length-1; index++){
if(arr[index] > arr[index+1]){
temp = arr[index]
arr[index] = arr[index+1]
arr[index+1] = temp
}
}
done++
}
return arr
}
function bubbleSort(a) {
for(let i = 0; i < a.length; ++i) {
let m = i;
for(let j = i+1; j < a.length; ++j) {
if(a[j] < a[m]) m = j;
}
let t = a[i];
a[i] = a[m];
a[m] = t;
}
}
function bubbleSort(arr) {
for(let i = 0; i < arr.length; i++) {
let s = false;
for(let j = 0; j < arr.length-i; j++) {
if(arr[j] > arr[j+1]) {
let t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
s = true;
}
}
if(!s) // Якщо не було перестановки - масив вже відсортовано
return;
}
}
function bubbleSort(arr){
for (let i = 0; i < arr.length; i++){
for (let j = 0; j < arr.length-i; j++){
if (arr[j] > arr[j+1]){
let k = arr[j];
arr[j] = arr[j+1];
arr[j+1] = k;
}
}
}
}
function bubbleSort(arr) {
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < ( arr.length - i -1 ); j++){
if(arr[j] > arr[j+1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j+1] = temp;
}
}
}
}
function bubbleSort(arr) {
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
function bubbleSort(arr){
for(let i = arr.length - 1; i > 0 ; i--){
for(let g = 0; g < i; g++){
if(arr[g] > arr[g+1]){
[arr[g],arr[g+1]] = [arr[g+1],arr[g]]
}
}
}
}
function bubbleSort(arr) {
let temp;
for(let i=0;i< arr.length;i++)
{
for(let j=i;j< arr.length;j++)
{
if(arr[j]< arr[i])
{
temp = arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
}
function bubbleSort(arr) {
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
function bubbleSort(arr) {
for (let j = 0; j < arr.length ; j++) {
for(let i = 0 ; i < arr.length - j - 1; i++){
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
}
function bubbleSort(arr) {
let swapped;
do {
swapped = false;
for (let i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
swapped = true; //swapped values, so continue looping until no more swaps occur.
}
}
} while (swapped); //continue looping until no more swaps occur.
return arr; //return the sorted array.
}
function bubbleSort(arr){
let fixed = arr.length
while (fixed){
for (let i = 0; i < fixed - 1; ++i){
if (arr[i] > arr[i + 1]) [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
}
fixed--
}
}
function bubbleSort(arr){
for(let length=arr.length-1; length>=0; length--){
let max = length;
for(let i=0; i< length; i++){
if(arr[max]< arr[i]){
let tmp = arr[max];
arr[max] = arr[i];
arr[i] = tmp;
}
}
}
return arr;
}
function bubbleSort(arr){
for (let index = 0; index < arr.length; index++) {
for (let i = 0; i < arr.length-1; i++) {
if (arr[i]>arr[i+1]) {
let a = arr[i];
arr[i]=arr[i+1];
arr[i+1]=a;
}
}
}
}
function bubbleSort(arr) {
let isEnd = true;
while (isEnd) {
let i = 0;
isEnd = false;
while (i < arr.length - 1) {
if (arr[i] > arr[i + 1]) {
[arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
isEnd = true;
}
i++;
}
}
}
function bubbleSort(arr){
for(let i = 0; i < arr.length; i++) {
let s = false;
for(let j = 0; j < arr.length-i; j++) {
if(arr[j] > arr[j+1]) {
let t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
s = true;
}
}
if(!s)
return;
}
}
function bubbleSort(arr)
{
let time;
let max = arr.length-1;
for(let q = 0;q< arr.length-1;q++)
{
for(let i = 0;i< max;i++)
{
if(arr[i]>arr[i+1])
{
time = arr[i]
arr[i] = arr[i+1];
arr[i+1] = time;
}
}
max--;
}
return arr
}
function bubbleSort(arr) {
for (let i = 0; i < arr.length; i++) {
for (let j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
function bubbleSort(arr)
{
function change(i, j)
{
let t = arr[i]; arr[i] = arr[j]; arr[j] = t;
}
for (let r = 0; r < arr.length; r++)
{
for (let i = 0; i < arr.length; i++)
{
if (arr[i] > arr[i+1])
change(i, i+1);
}
}
}
function bubbleSort(arr)
{
let temp;
for(let i=0;i< arr.length;i++)
{
for(let j=i;j< arr.length;j++)
{
if(arr[j]< arr[i])
{
temp = arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
}
function bubbleSort(array) {
let bound = array.length - 1;
while (bound >= 1) {
for (let i = 0; i < bound; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bound--;
}
return array;
}
function bubbleSort(arr) {
for (let i = 0; i < arr.length ; i++) {
for(let j = 0 ; j < arr.length - i - 1; j++){
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j+1];
arr[j + 1] = temp;
}
}
}
return arr;
}
function bubbleSort(arr) {
let a;
let b = false;
let summa = 0;
while(!b) {
summa = 0;
for (let i = 1; i < arr.length; i++) {
if (arr[i] < arr[i - 1]) {
a = arr[i];
arr[i] = arr[i - 1];
arr[i - 1] = a;
summa++;
}
}
if(summa === 0) {
b = true;
}
}
}
function bubbleSort(arr){
for(i=0;i< arr.length;i++){
for(j=0;j< arr.length-1;j++){
if(arr[j]>arr[j+1]){
let a = arr[j]
arr[j]=arr[j+1]
arr[j+1]=a
}
}
}
}
function bubbleSort(arr){
for(let n = arr.length; n>0; n--){
for(let i = 1; i< n;i++){
if (arr[i-1]>arr[i]){let mem = arr[i]; arr[i]=arr[i-1]; arr[i-1]=mem}
}
}
}
function bubbleSort(arr) {
let swapped;
do {
swapped = false;
for (let i = 0; i < arr.length; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
swapped = true;
}
}
} while (swapped);
}
function bubbleSort(array) {
let bound = array.length - 1;
while (bound >= 1) {
for (let i = 0; i < bound; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bound--;
}
return array;
}
function bubbleSort(arr) {
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
let temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
function bubbleSort(arr){
let sortedInd=arr.length
while(sortedInd){
for(let left=0,right=1;right< sortedInd;left=left+1,right=right+1){
if(!(arr[right]>arr[left])){
[arr[left],arr[right]]=[arr[right],arr[left]]
}
}
sortedInd--
}
}
function bubbleSort(arr)
{
for (var i = 0, endI = arr.length - 1; i < endI; i++)
{
for (var j = 0, endJ = endI - i; j < endJ; j++)
{
if (arr[j] > arr[j + 1])
{
var swap = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = swap;
}
}
}
}
function bubbleSort(arr){
for (let i = 0; i < arr.length-1; i++){
for (let j = 0; j < arr.length-1-i; j++){
if (arr[j+1] < arr[j]){
let t = arr[j+1];
arr[j+1] = arr[j];
arr[j] = t;
}
}
}
return arr;
}
function bubbleSort(arr){
for (let i = 0; i < arr.length - 1; i++) {
for (j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
let temp = arr[i];
arr[i] = arr[j];
arr[j] = temp
}
}
}
}
function bubbleSort(arr)
{
for(let i = 0; i for(let k = 0; k < arr.length; k++){
if(arr[i] > arr[k]){
var gold = arr[k]
arr[k]=arr[i]
arr[i]=gold
}
}
}
return arr.reverse()
}
console.log(bubbleSort([3,5,-5,8, 8, -7]));
function bubbleSort(arr){
for(let i = 0; i < arr.length; i++){
for(let g = arr.length - 1; g > i; g--){
if(arr[g - 1] > arr[g]){
let temp = arr[g - 1]
arr[g-1] = arr[g]
arr[g]= temp
}
}
}
}
function bubbleSort(arr) {
let c = 0;
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
c = arr[j];
arr[j] = arr[j+1];
arr[j+1] = c;
}
}
}
return arr;
}
function bubbleSort(arr, k=1){
if (arr.length < 2) return;
for (let i=0; i< arr.length-k; i++){
if (arr[i]>arr[i+1]){
let num = arr[i];
arr[i] = arr[i+1];
arr[i+1] = num;
}
}
if (k != arr.length - 1) bubbleSort(arr, k+1);
}
function bubbleSort(arr) {
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
let temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
function bubbleSort(arr){
let temp;
for(let k = 0; k < arr.length; k++){
for(let i = 0; i < arr.length-1; i++){
if(arr[i] > arr[i+1]){
temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
}
}
}
for (let j = arr.length - 1; j > 0; j--) {
for (let i = 0; i < j; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
}
let bu = array.length - 1;
while (bu >= 1) {
for (let i = 0; i < bu; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bu--;
}
return array;
}
let temp = 0
let flag = true
let counter = 0
while(flag){
for(let i = 0; i< arr.length;i++){
if(arr[i]>arr[i+1]){
temp = arr[i+1]
arr.splice(i+1,1,arr[i])
arr.splice(i,1,temp)
temp = 0
counter++
}
}
if(counter == 0) flag = false
else counter = 0
}
}
buffer = 0;
for(let i = 0; i < array.length-1; i++){
for(let j = 0; j < array.length-1; j++){
if (array[j] > array[j+1]){
buffer = array[j];
array[j] = array[j+1];
array[j+1] = buffer;
}
}
}
}
{
for(i=0; i< arr.length-1; i++)
{
for(j=i+1; j< arr.length;j++)
{
if(arr[i]>arr[j])
{
let temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
}
}
}
}
for (var i = 0, endI = arr.length - 1; i < endI; i++) {
for (var j = 0, endJ = endI - i; j < endJ; j++) {
if (arr[j] > arr[j + 1]) {
var swap = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = swap;
}
}
}
return arr;
}
done = 0
while (done < arr.length) {
for(let index = 0; index < arr.length-1; index++){
if(arr[index] > arr[index+1]){
temp = arr[index]
arr[index] = arr[index+1]
arr[index+1] = temp
}
}
done++
}
return arr
}
for(let i = 0; i < a.length; ++i) {
let m = i;
for(let j = i+1; j < a.length; ++j) {
if(a[j] < a[m]) m = j;
}
let t = a[i];
a[i] = a[m];
a[m] = t;
}
}
for(let i = 0; i < arr.length; i++) {
let s = false;
for(let j = 0; j < arr.length-i; j++) {
if(arr[j] > arr[j+1]) {
let t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
s = true;
}
}
if(!s) // Якщо не було перестановки - масив вже відсортовано
return;
}
}
for (let i = 0; i < arr.length; i++){
for (let j = 0; j < arr.length-i; j++){
if (arr[j] > arr[j+1]){
let k = arr[j];
arr[j] = arr[j+1];
arr[j+1] = k;
}
}
}
}
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < ( arr.length - i -1 ); j++){
if(arr[j] > arr[j+1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j+1] = temp;
}
}
}
}
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
for(let i = arr.length - 1; i > 0 ; i--){
for(let g = 0; g < i; g++){
if(arr[g] > arr[g+1]){
[arr[g],arr[g+1]] = [arr[g+1],arr[g]]
}
}
}
}
let temp;
for(let i=0;i< arr.length;i++)
{
for(let j=i;j< arr.length;j++)
{
if(arr[j]< arr[i])
{
temp = arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
}
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
for (let j = 0; j < arr.length ; j++) {
for(let i = 0 ; i < arr.length - j - 1; i++){
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
}
let swapped;
do {
swapped = false;
for (let i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
swapped = true; //swapped values, so continue looping until no more swaps occur.
}
}
} while (swapped); //continue looping until no more swaps occur.
return arr; //return the sorted array.
}
let fixed = arr.length
while (fixed){
for (let i = 0; i < fixed - 1; ++i){
if (arr[i] > arr[i + 1]) [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
}
fixed--
}
}
for(let length=arr.length-1; length>=0; length--){
let max = length;
for(let i=0; i< length; i++){
if(arr[max]< arr[i]){
let tmp = arr[max];
arr[max] = arr[i];
arr[i] = tmp;
}
}
}
return arr;
}
for (let index = 0; index < arr.length; index++) {
for (let i = 0; i < arr.length-1; i++) {
if (arr[i]>arr[i+1]) {
let a = arr[i];
arr[i]=arr[i+1];
arr[i+1]=a;
}
}
}
}
let isEnd = true;
while (isEnd) {
let i = 0;
isEnd = false;
while (i < arr.length - 1) {
if (arr[i] > arr[i + 1]) {
[arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
isEnd = true;
}
i++;
}
}
}
for(let i = 0; i < arr.length; i++) {
let s = false;
for(let j = 0; j < arr.length-i; j++) {
if(arr[j] > arr[j+1]) {
let t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
s = true;
}
}
if(!s)
return;
}
}
{
let time;
let max = arr.length-1;
for(let q = 0;q< arr.length-1;q++)
{
for(let i = 0;i< max;i++)
{
if(arr[i]>arr[i+1])
{
time = arr[i]
arr[i] = arr[i+1];
arr[i+1] = time;
}
}
max--;
}
return arr
}
for (let i = 0; i < arr.length; i++) {
for (let j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
{
function change(i, j)
{
let t = arr[i]; arr[i] = arr[j]; arr[j] = t;
}
for (let r = 0; r < arr.length; r++)
{
for (let i = 0; i < arr.length; i++)
{
if (arr[i] > arr[i+1])
change(i, i+1);
}
}
}
{
let temp;
for(let i=0;i< arr.length;i++)
{
for(let j=i;j< arr.length;j++)
{
if(arr[j]< arr[i])
{
temp = arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
}
let bound = array.length - 1;
while (bound >= 1) {
for (let i = 0; i < bound; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bound--;
}
return array;
}
for (let i = 0; i < arr.length ; i++) {
for(let j = 0 ; j < arr.length - i - 1; j++){
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j+1];
arr[j + 1] = temp;
}
}
}
return arr;
}
let a;
let b = false;
let summa = 0;
while(!b) {
summa = 0;
for (let i = 1; i < arr.length; i++) {
if (arr[i] < arr[i - 1]) {
a = arr[i];
arr[i] = arr[i - 1];
arr[i - 1] = a;
summa++;
}
}
if(summa === 0) {
b = true;
}
}
}
for(i=0;i< arr.length;i++){
for(j=0;j< arr.length-1;j++){
if(arr[j]>arr[j+1]){
let a = arr[j]
arr[j]=arr[j+1]
arr[j+1]=a
}
}
}
}
for(let n = arr.length; n>0; n--){
for(let i = 1; i< n;i++){
if (arr[i-1]>arr[i]){let mem = arr[i]; arr[i]=arr[i-1]; arr[i-1]=mem}
}
}
}
let swapped;
do {
swapped = false;
for (let i = 0; i < arr.length; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
swapped = true;
}
}
} while (swapped);
}
let bound = array.length - 1;
while (bound >= 1) {
for (let i = 0; i < bound; i++) {
let a = array[i];
let b = array[i + 1];
if (a > b) {
array[i] = b;
array[i + 1] = a;
}
}
bound--;
}
return array;
}
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
let temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
let sortedInd=arr.length
while(sortedInd){
for(let left=0,right=1;right< sortedInd;left=left+1,right=right+1){
if(!(arr[right]>arr[left])){
[arr[left],arr[right]]=[arr[right],arr[left]]
}
}
sortedInd--
}
}
{
for (var i = 0, endI = arr.length - 1; i < endI; i++)
{
for (var j = 0, endJ = endI - i; j < endJ; j++)
{
if (arr[j] > arr[j + 1])
{
var swap = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = swap;
}
}
}
}
for (let i = 0; i < arr.length-1; i++){
for (let j = 0; j < arr.length-1-i; j++){
if (arr[j+1] < arr[j]){
let t = arr[j+1];
arr[j+1] = arr[j];
arr[j] = t;
}
}
}
return arr;
}
for (let i = 0; i < arr.length - 1; i++) {
for (j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
let temp = arr[i];
arr[i] = arr[j];
arr[j] = temp
}
}
}
}
{
for(let i = 0; i
if(arr[i] > arr[k]){
var gold = arr[k]
arr[k]=arr[i]
arr[i]=gold
}
}
}
return arr.reverse()
}
console.log(bubbleSort([3,5,-5,8, 8, -7]));
for(let i = 0; i < arr.length; i++){
for(let g = arr.length - 1; g > i; g--){
if(arr[g - 1] > arr[g]){
let temp = arr[g - 1]
arr[g-1] = arr[g]
arr[g]= temp
}
}
}
}
let c = 0;
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
c = arr[j];
arr[j] = arr[j+1];
arr[j+1] = c;
}
}
}
return arr;
}
if (arr.length < 2) return;
for (let i=0; i< arr.length-k; i++){
if (arr[i]>arr[i+1]){
let num = arr[i];
arr[i] = arr[i+1];
arr[i+1] = num;
}
}
if (k != arr.length - 1) bubbleSort(arr, k+1);
}
for(let i = 0; i < arr.length; i++){
for(let j = 0; j < arr.length -i; j++){
if(arr[j] > arr[j+1]){
let temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
return arr;
}
let temp;
for(let k = 0; k < arr.length; k++){
for(let i = 0; i < arr.length-1; i++){
if(arr[i] > arr[i+1]){
temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
}
}
}