PokeVideoPlayer v23.9-app.js-020924_
0143ab93_videojs8_1563605 licensed under gpl3-or-later
ImmersiveAmbientModecolor: #c5a395 (color 2)
Video Format : (720p) openh264 ( https://github.com/cisco/openh264) mp4a.40.2 | 44100Hz
Audio Format: 140 ( High )
PokeEncryptID: cadeb0e33069b474a18635912521efc154907b66a87b6698769bb3d3a7ecff3f4b7c175c56ce6233d6b8a5f9f1b8f7f9
Proxy : cal1.iv.ggtyler.dev - refresh the page to change the proxy location
Date : 1732405976088 - unknown on Apple WebKit
Mystery text : Tk1MS01GU0wtemMgaSAgbG92ICB1IGNhbDEuaXYuZ2d0eWxlci5kZXY=
143 : true
69,769 Views • Nov 15, 2024 • Click to toggle off description
Views : 69,769
Genre: Education
Uploaded At Nov 15, 2024 ^^
warning: returnyoutubedislikes may not be accurate, this is just an estiment ehe :3
Rating : 4.837 (112/2,630 LTDR)
95.92% of the users lieked the video!!
4.08% of the users dislieked the video!!
User score: 93.88- Overwhelmingly Positive
RYD date created : 2024-11-23T20:42:42.809137Z
See in json
74 Comments
Top Comments of this video!! :3
Pure technicality: O(inf) isn't a thing since it implies inf to be a constant number, which it isn't. Bogosort is usually is referred by its average case, which is O(n*n!)
256 |
Quantum bogosort is my algorithm of choice
43 |
Miracle sort has the best time complexity of also almost float("inf")
27 |
THEORETICALLY, BOGOSORT IS THE FASTEST SORT ALGORITHM BUT THAT'S ONLY IF YOU'RE REALLY, REALLY LUCKY. BEST CASE IF THE FIRST ITERATION OF THE ARRAY IS SORTED.
1 |
That’s assuming that the RNG is purely random, which it never is.
2 |
Bogosort
28 |
There is another sorting algorithm that has a best case of O(1) but all other cases O(inf). Miracle sort, is it sorted? Yes, good you're done on the first step, no, wait for a miracle and check again.
6 |
I am 16 years old and in school. Though coding is not in my syllabus, I try to learn it by myself on youtube and solving problems on leetcode(only solved like 10 in 30 in only c++) as I really like solving problems and find coding very fascinating. So I want to ask you fine gentlemen and ladies what should I do to learn about coding from top to bottom and what path should I take to make it a potential method of earning in future.
Also why do you say "Big" O of etc. etc.
Thanks for your valuable time.
7 |
This is bogo sort but worse
1 |
BOGO is the name I know for this
1 |
I dont know if im being baited but its normally referred as O(n!) average
2 |
Technically, O notation is an upper bound and by definition, it implies that the function only need to be smaller than the O notation for a certain coefficient and from a certain n, so, by definition, every algorithm is O(Infinity)!
2 |
Las Vegas sort
7 |
Bogus sort algorithm
1 |
In my perception O infinity means the algorithm will never find the solution. But in this algorithm you have high probability to get the result in 5! tries (or n!).
Edit : Ok I get it. I understand that whenever we have random or a probability, the worst case is infinity.
3 |
But it has a best case time of O(1) 😊
1 |
From all of the sorting algorithms, my favorite is the Miracle Sort. K, so… You have a list of items that you want to sort. And you. just. leave. it.. for eternity.
|
Miracle sort obviously
|
boggo sort but to have a time complexity of infinity it would require it to be impossible. I could take an array the size of the human genome(3 billion items) and given an infinite amount of time, we would eventually finish.
3b factorial is still a finite number although it is astronomically big. It would probably take longer then 100 times the age of the sun but eventually you could get an answer.
|
@GregHogg
1 week ago
Master data structures and algorithms for FREE at algomap.io/!
11 |