onjsdev
Region: TR
Thursday 02 July 2026 10:41:06 GMT
2011569
56323
100
1799
Music
Download
Comments
tmzbz :
67
2026-07-02 10:46:01
1857
EduuhVx :
6...
2026-07-02 22:23:42
153
Raydenoffi :
No need to sort the last one
2026-07-02 21:45:52
39
tienthanh🪈 :
I always use qsort or merge sort
2026-07-04 04:12:32
0
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
3
user377 :
with waht language
2026-07-04 21:55:26
0
BLRsg :
научи их сразу проанализировать все числа, после добавь логику сравнения , так ты оптимизируешь временные затраты
2026-07-05 12:34:06
301
someteh :
is there a code for while loops instead of for loops
2026-07-09 01:39:48
5
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
Kit the Cat :
teamwork makes the code work
2026-07-30 20:56:12
2
kirito2k8 :
tin lớp 12
2026-07-09 03:21:50
1
Hoài nam :
Game name?
2026-07-03 08:21:51
2
Oh-no :
Ese es todo el código
2026-07-04 00:57:21
0
Giggi_Ps5 :
lavandonia
2026-07-25 10:18:08
1
Mike_AAR17 :
esta en c# o en c++
2026-07-05 21:37:52
1
ᴅᴜʀᴏᴡ :
на 99 подумал что щас будет вставка где Ягами или л думает под саунд
2026-07-08 08:31:31
3
kipparap_ru :
СКИНЬ КОД ПОЖАЛУЙСТА 🙏🙏😭
2026-07-03 15:40:35
7
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
7
Pyae Khant Kyaw :
Website name ?
2026-07-03 01:21:10
2
жаба/котарбуз :
человеческая музыка
2026-08-15 11:52:04
1
Коля :
@Twanok меня удивил!!
2026-08-08 11:41:40
0
Kenji :
потеряла голову
2026-08-17 16:58:59
0
To see more videos from user @onjsdev, please go to the Tikwm
homepage.
