N ta elementli arr massivi berilgan. Bubble sort (pufakchali saralash) algoritmi yordamida uni o'sish tartibida saralab, natijani qaytaring.
func bubbleSort(N int, arr []int) []int {
// ...
}
Input: N=5, arr=[5,2,8,1,9]
Output: [1, 2, 5, 8, 9]
Input: N=4, arr=[10,5,15,8]
Output: [5, 8, 10, 15]
Input: N=6, arr=[3,7,2,9,1,8]
Output: [1, 2, 3, 7, 8, 9]
N-1 marta, ichki sikl qo'shni juftliklarni solishtiradi.arr[j] > arr[j+1] bo'lsa, ularni almashtiring. Asl massivni o'zgartirmaslik uchun nusxa oling.