Find Maximum of an Array using Recursion | Algorithms in JAVA

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the solution where we are required to find the maximum element of an array using recursive logic instead of an iterative logic. In this problem,

1. You are given a number n, representing the count of elements.
2. You are given n numbers.
3. You are required to find the maximum of input.

#recursion #algorithms

Рекомендации по теме
Комментарии
Автор

i never seen a teacher who is so talented (skilled ) and have this good level of sense of humor.
rare human isn't it.

ritikshrivastava
Автор

This kind of mentors and Channels Deserve Millions of Subscriber Thanks a lot sir you are life Saviour ❤❤

rockeykumar
Автор

this channel deserves more than anything loved the way you explain and especially the stack diagram

vikaskumarnitrr
Автор

Sir, you are the superhero of Recursion and me also. thank you from the bottom, my heart sir.

kumarmanish
Автор

And I always blamed myself for not being able to understand recursive problems/solutions. Looks like I never had a good teacher like you before. Thank you!!

vibhusha
Автор

Sir i love u literally...pura u tube dkhlia...aap s bdiya kisi n nhi pdaya recursion
Thank u so much😍😍😇
I m blessed

chiraggoel
Автор

this single video will have a special corner in my heart

utkarshsharma
Автор

Sir aap coding ke dada ho..kyaa samjhaya hai aapne..vo bhi free mai .. paise de kr bhi main nhi sikh pya tha recursion kaise kaam krta hai aapke videos neh iitni jldi sikha dia thank you sir best wishes for your success..

puneetkataria
Автор

I saw many vedios on recursion but sir ur explanation is damn good

raunakkumarmishra
Автор

Thank god I watched that interview in which sumit sir told about the resource section on pepcoding website. I am doing recursion questions from there and learning a lot. He is one of the most amazing teacher I have ever seen in my life. Thanks a lot sir.

Krishna-rtyf
Автор

Sir really i became a big fan of you after following and obeying everything you said in this course really now I wrote this same code own even without any fault thank you thank you so much for teaching this love from bihar sir ji❤️❤️❤️❤️❤️

chandanverma
Автор

Sumit Sir & whole pepcoding team all are amazing💝

raushankumargupta
Автор

We can also pass array length minus 1 as index and use base case as: public static int findMax(int arr[], int index) { if(index == 0) return arr[index]. return Math.max(arr[index], findMax(arr, index-1));

kushsharma
Автор

sir yeh ques meine leap of faith se kiya, bina soln dekhe(all thanks to you)

_rahulsain
Автор

Sir app baap ho sabke koi bhi DS algo ka iss level ka content nai leke a paya hai
Aman, Harry bhaiya logo ne bhi kosis kiya h lekin app bohot uppar ho bhaiya GOD level understanding karwate ho aap

rohankaran
Автор

Watched on 15 October, 2021 - Thanks for the video.

raj_kundalia
Автор

Great teacher comes from great places 🤠 Sumit sir Is really great 😊😊😊😊

mdshabrezakhtar
Автор

Why the channel has only 87k subscribers the channel deserves more than that plzz subscribe them no one gives such an amazing content for free hats off sumeet sir..

adityasingh-wmq
Автор

One more simple solution to understand :
static int maxArr(int[] arr, int idx){

if(idx == arr.length){
return 0;
}
int max = Math.max(arr[idx], maxArr(arr, idx +1));
return max;
}

shrad
Автор

I got offer from multiple MNCs because of Sumeet Malik sir... But this is nothing because one day mi v sir se pdhkr abhi product based me pahunch jaunga mjhe 200 percent trust h

mdshabrezakhtar