I'm doing selection and i'm already having a bad time, maybe because i'm new to algorithms. But i understand the sort itself, just coding it is weirdly difficult for me. @@kaanozk
@@nickgameredo1534 Binary search is a searching technique which works on sorted elements o(logn) and to make use of such techniques first we need to sort the elements right so merge sort O(n logn) is the best T.E possible to sort
For me, understanding it was never a problem, writing a code for it is.
Literally just finished the code for it and yeah it was a pain in the ass
Do companies ask to create the algorithm code from scratch??
@@dylanex1😂😂😂
Understand it is half written. The other half is repetition till your brain understands it
I'm doing selection and i'm already having a bad time, maybe because i'm new to algorithms. But i understand the sort itself, just coding it is weirdly difficult for me. @@kaanozk
Clever way of showing this algorithm
✌️
Did you just use the Minecraft damage sound effect
Yeah xD
@@boraxalgobruh
Thanks you earned a subscriber
Best explanation for algorithm🎉
Thanks a lot 😊
Best Explanation
Its good but only for who knows you need to do some voice over for this for who dont know what is it...
I'll do that
Thank you for this good animation to understand
very nice visual implementation 👍
thankyou
Thank you bro ❤
I can understand merge sort very well thankyou sir for this Vedi
Well done my boy
Really easy to understand with damage effect😂
hahaha 😂
Can u tell me the libraries used for this animation please
after effects basic animation
Ok tqq
Watching 3hrs before exam 😅😅😅
Thanks vro
best on youtube till now
Thanks bro ❤❤
Name of block visualisation?
awesome bro
Nice thanks 👍🏼
Any time!
Can u tell how i can learn this type of editing ?/🙂
I use after effects 🔥
Program 😢
Best
Thank you brother
shuukriiiya✌️
Powerful
what does nlogn mean
its the time complexity , n is the input size
why not use something with better time complexity like binary search
@@nickgameredo1534 Binary search is a searching technique which works on sorted elements o(logn) and to make use of such techniques first we need to sort the elements right so merge sort O(n logn) is the best T.E possible to sort
@@nickgameredo1534because this is for sorting. Also it’s not in order
Thnx brother
Lovely 😍
thankyou
can you sent me the source code
❤❤❤
what is "l"
and "r"
Left and right pointer
@@boraxalgo thank you bora dora
thanks very ez 😐
The best
🙏
00:00