Recursion - Pattern Questions + Bubble Sort + Selection Sort
Vložit
- čas přidán 21. 07. 2024
- In this video we solve some of the pattern problems using #recursion. Using which we implement bubble sort and selection sort with recursion.
Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Complete Java DSA playlist: • Java + DSA + Interview...
- Code, Assignments, & Notes: github.com/kunal-kushwaha/DSA...
➡️ Connect with me: kunalkushwaha.com
=========================================
Timestamps:
00:00 Introduction
01:19 Q1 : Triangle 1
09:27 Q2 : Triangle 2
13:44 Q3 : Bubble Sort
21:32 Q4 : Selection Sort
34:17 Outro
#placement #dsa #interviews
Recursion is the part where even the most intelligent of folks struggle and give up programming. In India, I have personally seen intelligent people reluctant to share their knowledge out of hyper competetiveness. You don't know how many lives you're building by generously sharing this top level knowledge free of cost. God will always bless you for this selfless noble act, Kunal Sir 🙏
good words and nice name though
@@mysteryman2213 😂
@@mysteryman2213 🤣
i noticed because you said legend
@@mysteryman2213
hahahha
Gotta appreciate how you linked the pattern thing to bubble sort and selection sort...at first I was confused about it but then in a moment I was like "woah got it". Top-notch playlist
Kunal, I cannot express my gratitude enough. Your teaching has been exceptional and transformative for me. I have finally grasped the concept of recursion - something that eluded me until now. You are an incredible teacher and mentor. PLEASE PLEASE PLEASE teach us more subjects like Hashmap and Dynamic programming. I am eagerly looking forward to taking those courses as well. 🙏
Yes, as you mentioned we r waiting for that course on DP that no-one has created so far !!!
Same here!
same here but it's more than one and half year gone!!
still waiting
@@udaysingh2929 khada hu aaj bhi wohi....
This playlist helps me a lot, thanks man for providing such a brilliant course
kunal beside programming your are really a good teacher like u started with patterns thats simillar to two sorting technique its amazing and really helpfull thanks
so here i completed more than half of the videos of this dsa playlist, day by day dsa is looking easy thanks to kunal for this amazing playlist and waiting for you to complete this playlist
Thanks for the amazing content kunal 🔥 kudos!
Hey Kunal, can you share a tentative timeline for this bootcamp? That will be very helpful. Anyways the videos are super awesome !!
Kunal bro on fire 2 videos within 24hrs 🔥🔥
your explaination is so clear i was able to solve the bubblesort and selection sort problem with recursion without looking your solution first. Thanks a lot brother you're really awesome
Have to say one has to put everything to create a course like this !!!
Thanks for the awesome and intuitive course but kunal bhai please complete this playlist. We really need videos on the rest of the topics!!!!!!!
MindBlowing , u just connected a simple pattern question to BubbleSort , gave JEE feel when my teachers used to connect Advance problems to a simple concept. I am eagerly waiting for the DP series.
I watch many videos for recursion but your one is the best because the way of teaching is good
Must say it is the best playlist for recursion over the internet so far ...
Hey @Kunal, thanks for all the awesome content you are providing for free. This is pure GOLD i must say. Can you point me to some of DP videos you have, I am not able to find anything on DP on your channel?
really liked how you changed the intuition of pattern algorithm to make us understand the recursions for both the sorts, kinda makes people get up from all the boring tutorial vibe, haha loved it
that was really cool
Thanks Kunal Bhaiya for sharing the knowldege.
Thanks for sharing ur beautiful knowledge kunal bro ❤️❤️❤️
I'm not a Java Programmer but Getting inspired by you, I have created a new Hackerank Account and started solving the problem solving questions again but this time I am using Recursion only. I have had six stars in problem solving before but I always struggled on Recursion. Thanks a lot Kunal Sir. You gave me inspiration. My core weakness was permutation and combination... Today after watching your algorithm on Recursion: Subset... I implemented the code in C# and I started jumping out of enthusiasm when it ran successfully.. I also implemented dynamic programming to it so it doesn't repeat on the same characters in the string. I can't elaborate with words how thankful I am.
Recursion guru Kunal Kushwaha. Eagerly waiting for dynamic programming series.
Although...am lil far from this lecture...but thankyouu for the consistency sir❤️✨
Oh gosh, I was banging my head against the wall! I really thought we were going to print the pattern using bubble sort. Now I understand that we're solving bubble sort using recursion, haha
As always, simplified and awesome explanation💚
After getting a feel of recursions,I'm able to solve all of them before the video🥲 thanks Kunal🙂
Bro make a video on how a new coder start it's journey and when we do internship
Time for a job change...
This is best playlists to work thru...
Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!
++
Good thought process by making that pattern question relatable to BubbleSort and SelectionSort.. Good knowledge is being grasped from you day by day 🙂
You're most welcome
Can you helpme out
find what's wrong with this selection code after debugging i get to know that the zero index value is swapping with it's next value when the before pass is sorted let me explained what i saw on debugging is
arr= 4 , 3 , 2 ,1 where s = 0; e = arr.length-1
when s = 0 (index) e = 2(index)
arr is sorted i got the desired answer
but when s = 0 and e = 1
it again get maximum value as 1 and rather than swapping with it self it is swapping with next index value and
resulting in 2 , 1 , 3 , 4
static void selection_sort(int[] arr)
{
helper(arr,0,arr.length-1,Integer.MIN_VALUE,-1);
}
static void helper(int[] arr, int s, int e,int max,int max_index)
{
if(e==0)
{
return;
}
if(s
@@KunalKushwaha Please continue this Bootcamp !!😪😭
@@santhosh7042in if condition you have to give like s
Man you taught me how to debug a code , and it is very usefull while doing recursion questions thanku so much
Thanks for this Recursion video
This playlist helps me a lot, thanks sir for providing such an amazing course..😇
Man, please continue this if it is possible.
What an explanation man!
Awesome content 👏👌
in the first program, the stack size is the total number of (*) or O(row^2) so we should return until we start printing the next row for good programming practice.
Kunal bro, is it possible to complete this Bootcamp by November 2nd week?
Hope you complete this Bootcamp by mid November!🙏
next year k november a gya abhi tk ni hua🤣🤣🤣🤣🤣🤣
@@yogeshyts han LOL🤣
@@aeroabrar_31 February m start hoga ab bola h usne
@@yogeshyts Kidhar bola hai bhai usne..
Mai toh puri tarah usi par depend hua hoon 🥺
@@aeroabrar_31 twitter p active h wo
thanks for this amazing video 🤗👍🏻🔥❤🔥
Bro you bring back my confidence and intrest in programming..❤️
Thank You so much brother!
Kunal a humble request to please start the topics like Dynamic programming, hashing and stuff. It will be very helpful. Your explanations are good that's why.
I will
@@KunalKushwaha Thank you for this course
Kunal is the OG of DSA teaching
Today I have done all easy question from the assignment and tomorrow I will try the medium one
wow this is wonderful really.
Kunal, The TC for best case scenario in Bubble sort is 0(n), however using the recursion example it is still o(n2). Is there a way to include an extra flag as parameter and break recusion if the array is already sorted like we did in iteration example.
brother, Please start DP series. You are magician.
For selection sort we can start column value from 1 since we assign max as 0 in initial all the time , we don't have to check 0 th position with 0th
i think for first if(c < r) it should be if(c
Awesome bro..when will you teach us dynamic programming?
Yes but later
@@KunalKushwaha ok 🙂🙂🙂🙂
@@KunalKushwaha dp 😢
Great video
Thank you my Guru 👏👏👏👏
7:23 eagerly waiting for it bhai!!!
Awesome 🔥
woooooo hoooooooooooooooooooo great video ✨😊
I love this course
You amazing brother thanks
I was hoping you finish this playlist.
nice content we love your efforts can you suggest me any course of android development❤❤
i hope i meet you one day and thank you!
10:00
this is also a one method for print the stars method
static void triangle(int r ,int c){
if (c 0) {
System.out.print("* ");
printStars(n - 1);
}
}
When any pattern question comes in interview what should i use iteration or recursion? could anybody tell
awesome😍😍😍😍
*This is my C++ Code. The course is Fantastic.*
void buble(int *arr,int n,int end,int itr)
{
if(end==0)
{
return;
}
if(arr[itr]>arr[itr+1]&&itr
Hello Sir bubble sort code is giving stackOver flow error when size of the array is increased .
Here is the constrain for the length of an array
1
u make things easier and simpler to understand .... thank u so much for this Recursion playlist 🔥🔥🔥...
Learnt a lot from you, like how to approach a problem and different ways of solving a particular problem and so on...
keep it up brother 🙂🙂🙂
Love from Kashmir ❤️
You are most welcome
brooo please bring DP playlist now its enough time im crying for your videos for DP
asusual kunal rocks!!!!!!!!!!
Bro put space after "as"
I've read it asexual Kunal rocks🤣
Nice Video
Thank You XD
Hi Kunal, Nice playlist ,it is helping me a lot ,I have a doubt like in triangle2 ,I think so you missed to mention that function call like (3,3) ,(2,2) ,(1,1) will also happen .Anyways thanks man for your amazing playlist.
Thanks.
cant figure out the space complexity and recurrence relation of recursive bubble sort. Any help will be appreciated!
In every classroom there are such students who ask like this 😁😁
hi
i wanted to ask that fun(4,4) will be called in stack or not ?
In the bubble sort, can we use for loop inside the recursion function, and pass a window size as an argument to the recursion function after every sub call to the bubbleSort function
Bhaiya (arrays ,pattern , strings..etc )on recursion topic ki easy ,medi ,hard arrange kar dijiye bhaiya please , aur Assignment mein aur ques practice ke hote toh acha rehta
Bro could you tell any documentation for java from where I could learn it
Amazing
you are a legend
pretty cool pretty cool
thank you so much
still watching consistently
😀😀😀
Wow , recursion ki ek aur video 😁😁
7 aur ayengi abhi
@@KunalKushwaha omg😌😌😀
bhai, I can't see dynamic problems video? Can you please upload one .. and bdw loved your content.
Video 29 Completed!
bubble sort gives stackoverflow at line no. 53 in your code , kindly take example as 4872.
12:58 why wont f(3,3), f(2,2), f(1,1) be called.... without them i dont think any function call will return at the else statement
Best❤️❤️
amazing
can anyone explain why swapping is with a[r-1] and not a[r]
Kunal, Can I learn C++ and Java together?
I know it's difficult but would there be a bigger problem in the future?
Learn either java or c++ thoroughly first .other language will take max 15 days for completion
@@prakhar266 Completely agree with with you bro, learn anyone first. then switching is to another is quite easy.
Syntax will screw u
If u try to learn it together
@@mohammedsuhail8706 bhai wahi hogaya mere sath .
@KunalKushwaha when will you start dynamic programming series?
Supper 🙏
Will following solution work for Triangle 1?
function logger(r, c) {
if(r === 0) return;
const arr = [];
while( r > c) {
arr.push('$');
c++;
}
console.log(...arr);
r -= 1;
logger(r,0);
}
function printTriangle(n) {
logger(n, 0);
}
printTriangle(10);
thank youu;)
thank you bhiya
Nice video,but pls complete the playlist
Make video on quick sort and mergesort using recursion
At this stage I'm able to solve given problems before i see your solution 🙌 hats off and huge thanks to you for helping me in developing the approach ❤️💯
Q. 1 solution
Def triangle(n) :
If n==0:
return
Print("* "*n)
triangle (n-1)
❤...bro linkedlist,graphs,dp videos?