onjsdev
Region: TR
Thursday 02 July 2026 10:41:06 GMT
778061
25183
56
827
Music
Download
Comments
tmzbz :
67
2026-07-02 10:46:01
652
EduuhVx :
6...
2026-07-02 22:23:42
65
Smile! :
6767676767676767
2026-07-04 09:28:51
1
Raydenoffi :
No need to sort the last one
2026-07-02 21:45:52
14
Sean Kelly6316 :
For a second, I thought I misunderstood selection sort, but I think this particular way of demonstrating it just caused this issue. But in short it's basically starts at the beginning with n-th pass, it starts at indeed n-1 (first pass starting with 0 indexed element) comparing that element to each as it passes through whole array, and finds the minima, in each pass, swapping it with the original value at n-1. So, much like bubble sort, it picks out the minima/maxima to go at the end, then they stay there. (I think it's the picking up of the values and putting them back that makes this graphical depiction a bit confusing. They actually stay at that value the whole time, until you swap.)
2026-07-03 22:53:40
2
Oh-no :
Ese es todo el código
2026-07-04 00:57:21
0
Hoài nam :
Game name?
2026-07-03 08:21:51
1
little_programmer📊 :
Does this code only work on a computer or can it also be used on a phone?
2026-07-04 05:13:46
0
kipparap_ru :
СКИНЬ КОД ПОЖАЛУЙСТА 🙏🙏😭
2026-07-03 15:40:35
1
Nguyễn Thế Hiển :
nó giống với code mà tôi học lớp 11 môn tin học
2026-07-04 14:48:31
0
Teodoro roosevelt :
#:D
2026-07-04 15:33:22
0
Whisper :
The animation helps paint mental picture
2026-07-04 11:32:56
0
чюпеп :
Они когда все прошли не могли запомнить куда ставить сразу
2026-07-03 18:45:01
6
Pyae Khant Kyaw :
Website name ?
2026-07-03 01:21:10
2
iROBE :
With large numbers and extensive data, another method is used: calculating the current value in half of the complete data. If it's higher, it returns to the next half of the wave; if lower, it moves to another half of the wave, and so on until the correct value is found. It's worth noting that this is usually achieved in about 12 attempts.
2026-07-03 06:58:11
9
larik :
smth more to improve: give it memory to store the value of all things, it will know which is next on 1st go qnd just run to select them without checling others, as well add that when second last is sorted then the whole thing is
2026-07-02 12:22:47
6
Quang Linh :
C++ or python
2026-07-04 12:21:00
0
tienthanh_20070 :
I always use qsort or merge sort
2026-07-04 04:12:32
0
rowandsushi :
great algorithm
2026-07-03 11:56:21
0
Sean Kelly6316 :
I've also seen it said that this algorithm takes nontrivial auxiliary space, I'm fairly sure. I don't really get that aspect of it, and sending neither do most others. Similarly seen different claims here regarding merge sort
2026-07-03 23:02:37
0
To see more videos from user @onjsdev, please go to the Tikwm
homepage.
