Why doesn't this code work?

Question

https://code.sololearn.com/cNZE6E5Lv33t/?ref=app

Answer 1

here it is.

https://code.sololearn.com/cp7eqoIzRs51/?ref=app

Answer 2

I just learnt selection sort today 😂 in Python

Answer 3

u did

ar [i] = ar [j]
ar [j] = ar [i]

do this...

t = ar[i]
ar [i] = ar [j]
ar [j] = t
see my code

Answer 4

learn all this@@ VENGAT
bubble sort
selection sort
quick sort
insertion sort
merge sort
heapsort
radix sort
counting sort....😂😂

Answer 5

@@@ VENGAT ENJOY MY DETAILED SORT LIST###@@@@

*.Selection Sort
*.Bubble Sort
*.Recursive Bubble Sort
*.Insertion Sort
*.Recursive Insertion Sort
*.Merge Sort
*.Iterative Merge Sort
*.Quick Sort
*.Iterative Quick Sort
*.Heap Sort
*.Counting Sort
*.Radix Sort
*.Bucket Sort
*.ShellSort
*.TimSort
*.Comb Sort
*.Pigeonhole Sort
*.Cycle Sort
*.Cocktail Sort
*.Bitonic Sort
*.Pancake sorting
*.Binary Insertion Sort
*.BogoSort or Permutation Sort
*.Gnome Sort
*.Structure Sorting (By Multiple Rules) in C++
*.Stooge Sort
*.Tag Sort (To get both sorted and original)
*.Tree Sort
*.Cartesian Tree Sorting
*.Odd-Even Sort / Brick Sort
*.QuickSort on Singly Linked List
*.QuickSort on Doubly Linked List
*.3-Way QuickSort (Dutch National Flag)
*.Merge Sort for Linked Lists
*.Merge Sort for Doubly Linked List
*.3-way Merge Sort

Answer 6

bro u are using bubble sort and u r runing first loop till the length??? 1st loop -(length-1) and the inner loop should be (length -i-1)!! try it