Recursion - Pattern Questions + Bubble Sort + Selection Sort

[@KunalKushwaha]

DSA + interview preparation playlist: kzbin.info/aero/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ

[@WORK-HARD-jm4cg]

bro graphs and dp please

[@karthikb975]

In one word your explanation and teaching and the content your providing is better than the paid courses. Thank you kunal sir your dsa course helping us a lot to learn the dsa in easy way. And also we are waiting for the course on DP and Graphs that no-one has created so far !!! so plese make that concepts also

[@saisivananduri819]

bro when will you complete the dsa course you say in every video we will do dynamic programming but you discontinues the course

[@Tomharry910]

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 🙏

[@mysteryman2213]

good words and nice name though

[@aakashbhandari9761]

​@@mysteryman2213 😂

[@plutomessi21]

@@mysteryman2213 🤣

[@albin6126]

i noticed because you said legend @@mysteryman2213

[@शुभम-सेमवाल]

hahahha

[@realism2463]

Dp bro please , u r the best teacher i got so far , and struggling in dp the most , want to study from you !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@nikolas8203]

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

[@ronitsharma0352]

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!!!!!!!

[@MozhdehNourizadeh]

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. 🙏

[@prasadm3614]

Yes, as you mentioned we r waiting for that course on DP that no-one has created so far !!!

[@KrishNamaste]

Same here!

[@shantohossain1372]

same here but it's more than one and half year gone!!

[@udaysingh2929]

still waiting

[@prtk2verma]

@@udaysingh2929 khada hu aaj bhi wohi....

[@veeee5577]

still waiting

[@saurabhjaswal21]

This playlist helps me a lot, thanks man for providing such a brilliant course

[@TheDailyWordChannel]

Trust me when you add dp and graphs then all subscribes are view those videos and you cant even know how they appreciate you then every day you feel so proud by those words

[@Sant-8988]

The thing is he has no time now for teaching.

[@senseiAree]

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.

[@mrwhosetheboss6876]

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

[@preetidas9155]

the best recursion playlist on KZbin🙌

[@learnandtravel7722]

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

[@devjoshi7062]

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

[@khushipurohit8761]

that was really cool

[@vedanta007]

Kunal bro on fire 2 videos within 24hrs 🔥🔥

[@sidhantgupta64]

I watch many videos for recursion but your one is the best because the way of teaching is good

[@aryangupta6335]

Must say it is the best playlist for recursion over the internet so far ...

[@stranger_0911]

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

[@AdityaSingh-nz2if]

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.

[@jamespeterson7824]

Good thought process by making that pattern question relatable to BubbleSort and SelectionSort.. Good knowledge is being grasped from you day by day 🙂

[@KunalKushwaha]

You're most welcome

[@santhosh7042]

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

[@aeroabrar_31]

@@KunalKushwaha Please continue this Bootcamp !!😪😭

[@akashstark1836]

​@@santhosh7042in if condition you have to give like s

[@KshitizAnand-xr1wj]

Thank you so much Kunal for teaching us the recursive way of bubble sort and selection sort, that was so amazing.

[@ridoychandradey8337]

Recursion guru Kunal Kushwaha. Eagerly waiting for dynamic programming series.

[@abirgupta2711]

Hey Kunal, can you share a tentative timeline for this bootcamp? That will be very helpful. Anyways the videos are super awesome !!

[@malishagavali9225]

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

[@keshavdeosharma7222]

Thanks Kunal Bhaiya for sharing the knowldege.

[@Helly_Patel]

Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!

[@deepanshu5394]

++

[@rajeevkandpal1880]

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?

[@burhanuddinraja7209]

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.

[@KunalKushwaha]

I will

[@burhanuddinraja7209]

@@KunalKushwaha Thank you for this course

[@DeepeshKumarSingh-ey5vl]

@@KunalKushwaha But when????????

[@MegaArvind111]

Time for a job change... This is best playlists to work thru...

[@abhinavrai5762]

Kunal Sir please complete this video playlist we really need you out here...

[@MuhammadAzeem-bd7xf]

I guess I'm getting decent at recursion man. Thanks Kunal with Love from Pakistan

[@shadowmonarch1432]

After getting a feel of recursions,I'm able to solve all of them before the video🥲 thanks Kunal🙂

[@fitnessandscience1575]

Thanks for sharing ur beautiful knowledge kunal bro ❤️❤️❤️

[@aman_mandal]

Although...am lil far from this lecture...but thankyouu for the consistency sir❤️✨

[@shraddhaverma6434]

Thanks for the amazing content kunal 🔥 kudos!

[@KhushiSingh-ft8dk]

This playlist helps me a lot, thanks sir for providing such an amazing course..😇

[@akshaygill4483]

Man you taught me how to debug a code , and it is very usefull while doing recursion questions thanku so much

[@Hello_Beasty]

Bro make a video on how a new coder start it's journey and when we do internship

[@dipalitusharvlogs7252]

As always, simplified and awesome explanation💚

[@reshihashim4094]

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 ❤️

[@KunalKushwaha]

You are most welcome

[@mathis-meth4229]

Kunal is the OG of DSA teaching

[@Aspirantonmission25]

Sir,you made my life so easy ❤❤❤

[@srinivasanshankaranarayana3093]

Awesome content 👏👌

[@devendrasolunke4619]

Bro you bring back my confidence and intrest in programming..❤️

[@KrishNamaste]

Man, please continue this if it is possible.

[@parul8334]

Today I have done all easy question from the assignment and tomorrow I will try the medium one

[@hello_kitty1234-r9l]

kunal be like : no i m not gonna explain it again and after 5 mins he is literally explaining same thing just to make us understand , hats off to him man

[@nayanmu]

Awesome bro..when will you teach us dynamic programming?

[@KunalKushwaha]

Yes but later

[@mahajveemahajvee8941]

@@KunalKushwaha ok 🙂🙂🙂🙂

[@ziadotenv]

​@@KunalKushwaha dp 😢

[@pawanyadav4024]

thank you so much for simplifying the selection sort

[@kritikjain3617]

What an explanation man!

[@KovidhVSBhati]

i think for first if(c < r) it should be if(c

[@450Santoshmaharana]

@KovidhVSBhati I believe, in last else condition (when c==r), swap when last element in array is less then max

[@ShaikAtif-kg5qm]

bro, column value starts from 0, so let say for example r=4, then c will be from 0 to 3. from 0 to 3 four checks are done so no need of c

[@atulpanda6051]

Thanks for this Recursion video

[@cindrasenareddy1929]

asusual kunal rocks!!!!!!!!!!

[@amaanullah13]

Bro put space after "as" I've read it asexual Kunal rocks🤣

[@Adonis08]

Selection Sort Without Max Variable!! static void selection(int[] arr, int r, int c) { if(r==0) return; if(r>c) { if(arr[c]>arr[r]) { int t=arr[c]; arr[c]=arr[r]; arr[r]=t; } selection(arr,r,c+1); } else{ selection(arr,r-1,0); } }

[@litheshshetty7839]

7:23 eagerly waiting for it bhai!!!

[@Furious_footballs]

short code for triangle 1 static void pattern(int row , int col) { if(row==col) { System.out.println(); pattern(row-1,0); } if(row>col) { System.out.print("* "); pattern(row,col+1); }

[@foyzanahmed4091]

brother, Please start DP series. You are magician.

[@Aniket_0314]

woooooo hoooooooooooooooooooo great video ✨😊

[@agamverma8480]

Bhaiyaaa please bring the DP series. Eagerly waiting for it.

[@dinbandhusharma4568]

thanks for this amazing video 🤗👍🏻🔥❤‍🔥

[@kishanmadlani1391]

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); } }

[@akshayjha8369]

pls upload dp and graph videos asap

[@sudhanshukushwaha6351]

In every classroom there are such students who ask like this 😁😁

[@nikitajaiswal9112]

Q. 1 solution Def triangle(n) : If n==0: return Print("* "*n) triangle (n-1)

[@yogeshkumarpandey2343]

*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

[@kanyapandey]

Thank you my Guru 👏👏👏👏

[@keshav-ip7vx]

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.

[@kvcricketech]

Dynamic programming playlist please

[@PurnaPlayss]

Thank you 👍

[@akashstark1836]

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

[@priyanshuvettori5179]

wow this is wonderful really.

[@amandixit8342]

Wow , recursion ki ek aur video 😁😁

[@KunalKushwaha]

7 aur ayengi abhi

[@Dekh_rha_hai_vinod.]

@@KunalKushwaha omg😌😌😀

[@anandrengu5806]

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.

[@khushaldodeja8267]

Thanks.

[@kartik7239]

I was hoping you finish this playlist.

[@spdwivedi5925]

Great video

[@mohakhiphop]

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 ❤️💯

[@mudittiwari8615]

I love this course

[@positive-e9m]

kunal....please please upload the Dynammic programming , and remaing stuffs in DSA

[@varunsen2802]

Thank You so much brother!

[@Luffy_2804]

after hint : static void printPattern(int row , int col , int n){ if(row==0) return; if(col

[@arbindsharma1423]

bhai, I can't see dynamic problems video? Can you please upload one .. and bdw loved your content.

[@anchit1237]

Kunal, Can I learn C++ and Java together? I know it's difficult but would there be a bigger problem in the future?

[@prakhar266]

Learn either java or c++ thoroughly first .other language will take max 15 days for completion

[@rashidansari4176]

@@prakhar266 Completely agree with with you bro, learn anyone first. then switching is to another is quite easy.

[@mohammedsuhail8706]

Syntax will screw u If u try to learn it together

[@amansayer4943]

@@mohammedsuhail8706 bhai wahi hogaya mere sath .

[@Aakashhoney278]

please complete the course sir

[@akhilyadav7540]

Kunal please make a video on dynamic programming and grap also 🙏🙏❤

[@akhilyadav7540]

Graph*

[@rahuldev6206]

nice content we love your efforts can you suggest me any course of android development❤❤

[@anush_20]

6:50 bro when u gonna do dynamic programming

[@ihsannuruliman3656]

Great coding, probably a little bit improvement to the recursive bubble sort algorithm. We don't need to check further if no swap happened in a row. Here, i is column and end is row. static boolean swapped = false; public static void sort(int[] arr, int i, int end) { if(end < 1) return; if(i < end) { if(arr[i] > arr[i+1]) { // swapping int temp = arr[i+1]; arr[i+1] = arr[i]; arr[i] = temp; swapped = true; } sort(arr, ++i, end); } else { if(!swapped) return; swapped = false; sort(arr, 0, --end); } }

[@harish-fw6cw]

Thank you bro

[@virat7800]

awesome😍😍😍😍

[@itshari5489]

32:05 We are considering index value not the exact value. arr[max] = 4 & arr[c] = 4 By mistake kunal says 4 greater than max value. Instead its equal so no updation in max index postion.

[@AishwaryaSinha-t4o]

i think def triangle(n): if n==0: return else: print(n*'*') return triangle(n-1) is more concise and easy

[@allaboutgamimg7976]

Awesome 🔥

[@pikayaan]

the 1st triangle can be solved using only one variable with the help of a helper function:-- static void pureRecur(int i) { if (i == 0) return; printrow(i); pureRecur(--i); } static void printrow(int n) { if (n == 0) { System.out.println(); return; } System.out.print("*"); printrow(--n); } public static void main(String[] args) { pureRecur(10); }

[@surya.6907]

you are doing same man,just making another method doesnot change the fact that you took two parameters (n and i) in those methods.

[@vaishnaviummaji321]

@KunalKushwaha when will you start dynamic programming series?

[@feliksbekeshov7668]

Kunal when we will have Trees and Graphs here in this DSA playlist??????

[@shubhanshukushwaha6150]

bubble sort gives stackoverflow at line no. 53 in your code , kindly take example as 4872.

[@garvitmathodia8268]

bro please make a series on DP

[@naruhitoabiku9451]

you are a legend

[@rudram4534]

still watching consistently 😀😀😀

[@sravanakirtana2787]

Nice Video