Great explanation and awesome suggestions to understand the concepts. Great... Please keep posting for datastuctures all concepts including trees and important top product company interview questions
I can understand your interest in teaching. it's awesome. One suggestion, you explained the code well, animation helped to visualize the code but it is not teaching how to think and craft the code for instance you said start the I always next to low, but you did not discuss the why part! Instead of explaining the code, it would be better if you explain why each statement is there and what the alternatives are. Thanks for your hard work. New subscriber in your list 😊
It's excellent sir... Good effort guys 😊.... Pleas will upload more videos about core Java. Array, string, recursive, collection, exception, threading.... We are waiting for your videos Sir... Thank you so much.
anna video content ellam supera iruku anna first time algorithm and tutorials in tamil super going anna sikiram makkal support panuvanga anna please dont stop anna due to less subscribers tamil channels urupadiyanadhu epovuma pickup aga late agum
U mean that you are getting an array out of bound exception? We are checking whether j>= L So, there won't be any issue. If you are facing any error, let me know.
U mean that you are getting an array out of bound exception? We are checking whether j>= L So, there won't be any issue. If you are facing any error, let me know.
Bro ithula neega antha 10 and 14 ku epdi L R and I and J edukanum nu sollavea illa Apdiyea swap aagura maari sollitiga athu epdi i vabthu L ku next elements ah thana erukum apa 10 tha I apo j amd R ah etha choose pandrathu epdi anga swapping nadakum itha neega solli erukanun sollavea illa
Quick sort and merge sort will sort the array much faster than bubble sort. See all the three vidoe and understand each concept so that u will get a clear idea.
It's useful now at 2021 and forever who needs later, keep doing bro, thank you 👍🏻
Thank you so much sir 🙏, everyone can understand
It is useful in 2024
Awesome explanation ! keep posting more data structure algorithms
Sure thanks for the support.
Yes bro you are right👍👍
@@pradeeshtet brother their is a index bounded error...in such case j become 0 , when recursion run it will be j-1
Great explanation and awesome suggestions to understand the concepts. Great... Please keep posting for datastuctures all concepts including trees and important top product company interview questions
Thanks bro , your explanation is great 👍
Very well explaination bro 🤜 thankyou bro intha mari naraya video podunga bro🥰
Program Ivlo perisa iruku ithuku perthaan quick sorta?😂
Int a[] = {4,6,2,5,10};
Array.Sort(a);
foreach (var item in a )
{
Console.WriteLine("" + a);
}
Using arrays.sort is not an optimised approach. We should know how sorting algorithms work and it's time complexity. It helps a lot during interview.
ithhu program illa itha vida perusu athu . bro ithu quick sort bro not a small sort
Thankyou so much anna☺️❤️
With animation u explaining this kind of things really awesome bruhhh
Thank u. Share with ur frnds and support the channel
Excellent. Please continue your contribution. We will support you.
Sure thank you
Excellent effort
Thank you for your great explanation and how about complexity of the algorithm if possible
best explanation
Worth uh bro ...
unga voice romba nalla iruku 🥰
Its very useful👍❤
I can understand your interest in teaching. it's awesome. One suggestion, you explained the code well, animation helped to visualize the code but it is not teaching how to think and craft the code for instance you said start the I always next to low, but you did not discuss the why part! Instead of explaining the code, it would be better if you explain why each statement is there and what the alternatives are. Thanks for your hard work. New subscriber in your list 😊
Thanks for the valuable feedback. These DSA videos were posted when I started the channel. Will consider the feedback in the upcoming videos.
Thank you so much bro
Super bro
Bro thank you bro... Really helpful for my finals...
Welcome. All the best 👍
thala vera lvl
Anna edha madiri tamila c programming la neeraiya content podunga.Ugaluku full support kadaikum.
really a good work bro
but volume inum konjam athigama iruntha will be better
This viedo is very useful sir very thank you
It's excellent sir... Good effort guys 😊.... Pleas will upload more videos about core Java. Array, string, recursive, collection, exception, threading.... We are waiting for your videos Sir... Thank you so much.
Sure I wil post more videos ..share with ur frnds and keep supporting us 😊
Definitely sir.....
ji super ji, nalla purinjidhu
Great Explanation, Thanks
anna video content ellam supera iruku anna first time algorithm and tutorials in tamil super going anna
sikiram makkal support panuvanga anna please dont stop anna due to less subscribers
tamil channels urupadiyanadhu epovuma pickup aga late agum
thanks for the support thambi. Will be posting good contents more
Good work bro
Super☺👍👍👍👍👍👍👏👏👏👏 continue
Supper bro now i understand 😍
One word "Awesome"
Awesome explanation👌👍
Tnq it is very usefull to my exam
All the best
Superb explanation bro but innum konjam loud aah pesi irukalam...
romba thanks brother....
Well explanation
Superb ....
Thank you so much bro ☺️
Super bro.... Pls do more videos
Sure 👍
Super explanation bro
Super bro.... Keep going 🤩🤩
Well explained 🙏
Thank u for this video ❣️❣️❣️
Bro if(i
very useful vro❤
Good effort.. keep it up
bro it's amazing....
Anna same number kudutha epdi na swap pandradhu ignore pannirnuma?
Xcellent bro
Ji add more videos DSA are important for all the developers.
Osmmm
👍
Tqsm Sir😄
Thank you 🥺🥺
Thank you bro
@pradeesh tet brother their is a index bounded error...in such case j become 0 , when recursion run it will be j-1
U mean that you are getting an array out of bound exception? We are checking whether j>= L So, there won't be any issue. If you are facing any error, let me know.
U mean that you are getting an array out of bound exception? We are checking whether j>= L So, there won't be any issue. If you are facing any error, let me know.
Vera 11 po bro😎
bro konjam genrics ,threads videos la podunga bro tq
super bro.....
Super
thankss bruh
bro, next time run the code.. it is very useful
Make a video for explaining Big O notation bro
sir we want to more video like dis. please tel us how to join to ur class
Wat class do u need? Mail me pradeeshtet@gmail.com
Nice bro. Bro which tool bro use pandringa for animation explanation.
Bro use ful tips and tricks in control system is very full ilovabajsvshsh
Bro ithula neega antha 10 and 14 ku epdi L R and I and J edukanum nu sollavea illa Apdiyea swap aagura maari sollitiga athu epdi i vabthu L ku next elements ah thana erukum apa 10 tha I apo j amd R ah etha choose pandrathu epdi anga swapping nadakum itha neega solli erukanun sollavea illa
Bubble sort easy ah irukkumae ...antha concept mattum pothumla bro...athulaiyae ascending order ah set panlam lah bro...apram ethukku merge and quick sort
Quick sort and merge sort will sort the array much faster than bubble sort. See all the three vidoe and understand each concept so that u will get a clear idea.
@@pradeeshtet spr bro...thanks ....tree related ah algorithms podungha bro...
Ji mass bro apdiye bubble sort other sorts podnga
Bubble sort, merge sort lam already poturukan bro check it out
@@pradeeshtet tq upload select sort insert sort
Pivot um j um orae yedathula vantha ena panrathu adhae mari pivot um i um orae yedathula vantha ena pananum
💯☕☕
Thala... Remaining sort la podunga bro....Tamil la yaarum data structure solli tharala bro....neenga eduthu pannunga....
As of now uploaded merge sort and bubble sort. More will be uploaded soon
Do more videos bro
explain about Big O 1. Best case: O(nLogn)
2. Average case: O(nLogn)
3. Worst case: O (n^2)
Sure will upload separate video for time complexity
bro so basic ah Swaping time la namba index tha paknum ah or values ah pakanuma
Since we r comparing the values. Values should be considered
How do you make animations
Bro why there is i+=1;
It's i initial point
Binary tree poduga bro
10 and 14 le edhu bRo pivot element ?
suppose i,j rendume large and small ha irutha yenna bro pannurathu
How ? Unique numbers, so either i will be smaller than j or i will be greater than j
Sound sariya keka mateenguthu bro
Bro you can increase your voice a little bit 🙂
L r na enna bro
Sollu tharathu nalla puriyudhu bro...but algrithm, program la elutha varathu..🥺
Good by practicing you will get it. Check the coding boss playlist in our channel.
@@pradeeshtet 👍
bro i and j same place la iruntha eppidi change panrathu
bro satheyama pureyala
Focus and watch one more time and also watch other quick sort videos u will understand the concept for sure
Super bro
Thank you bro
👍