Program To Find GCD Or HCF Of Two Given Numbers In Java | FREE DSA Course in JAVA | Lecture 8
Рет қаралды 24,329
Күн бұрынData Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
We are up with the lecture 8 of our much awaited dsa course in java.
As we are proceeding with our mathematics module of our DSA course, today we will learn how to find the greatest common divisor or highest common factor of given two numbers.
This is a very basic concept in your journey to competitive programming or many a times companies directly ask for GCD or HCF of two given numbers in the coding round of placement.
Hence in our data structures and algorithms series, we feel it is important for you to learn the method to find the gcd/hcf of two number.
In this video we will learn the complete logic behind the program using the AR technology as well as a proper code for the same.
So without wasting any time, let's jump to our lecture 8 of free dsa course for job placement in java.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
For more information, fill this form: forms.gle/8eiU...
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacad...
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder #gcd #hcf
@easycraftideasbyms3475 Ай бұрын
Nice explanation sir👏
@shilpamanikkan7118 Жыл бұрын
Seriously no words!! this lecture was just perfect. I dint even realize that it was 43 mins video👏👏 Totally worth it💯
@TAPACADEMY Жыл бұрын
Glad you liked it! Do subscribe to the channel.
@shilpamanikkan7118 Жыл бұрын
@@TAPACADEMY done already.. pls post videos that helps in logic building in java.. i am working as backend developer in Java.. it will be so helpful 😊
@AjitKumar-gn1se 7 ай бұрын
The video might seem too long for people who are looking for a GCD/HCF program. However, once you watch it, the concepts will stick with you and help you whenever you think of GCD and HCF programs. I am a big fan of this man's explanation. Hats off to him!
@51nishanthi.s71 7 ай бұрын
amazing bro
@harichandra1131 Жыл бұрын
This channel deserves millions+ Subscriber's Such an amazing explanation 🙀
@venkadeshb7973 Жыл бұрын
@TAPACADEMY Can you please clarify at 42:50 why the Optimized Euclid Algorithm has O = log(Min(a,b)) ? Since the iterations occur for Max value and we keep dividing the Max value hence it should be O = log(Max(a,b)) right?
@protuctivity-sn3fm Жыл бұрын
Best/Perfect Explaination ever ..... 💥
@raghuvaranr6862 Жыл бұрын
Superb explanation 👌 . I never seen thease kind of quality lectures and explanation before.
@TAPACADEMY Жыл бұрын
Glad to hear that. Stay tuned and do share our course in your community.
@bhuvanastutorial373 7 ай бұрын
can you explain 17:00 , how min+1 will be the frequency , it will be min only sir.
@abhimanyu8131 Жыл бұрын
mann you are insane !! loved the way you taught!
@wul_frik Жыл бұрын
Really great explanation.
@SP-bs4nk Жыл бұрын
This video is incredibly informative! I've been struggling with this concept for a while, and your explanation made it so much clearer.
@TAPACADEMY Жыл бұрын
Glad to know this. Do subscribe to our channel and share it within your community.
@jjoelthomas 7 ай бұрын
Excellent. Amazing. Hats off
@user-ds4ym3hs4e Жыл бұрын
Sir I have became your fan, by seeing this single video. Literally great 👍 👌 👏 .Not getting any words to appreciate your explanation. Really amazing explanation.
@arushitandon4766 4 ай бұрын
Wow! Your explanation is spot on. Thank you, sir, for providing such informative content.
@simalinaaz5640 Жыл бұрын
the best explaination ever!
@yunik_developer 3 ай бұрын
The best thing is that he covered all exceptions and errors which we will definitely do and it will remember in our mind great explanation
@varsharajput243 6 ай бұрын
you make every algo so simple and easy.Kudos for your effort.
@Englishwithhimanshu8581 10 ай бұрын
Sir good job sir I understand fully clear
@bindu6790 9 ай бұрын
Excellent man,superb explanation
@kundrapuharika6294 7 ай бұрын
My god it's unbelievable,this man has explained everything crystal clearly,I feel extremely happy to find this video Thanks a lot sir👏
@techtuber1344 Жыл бұрын
Great explaination i wish everyone teaches like you :) it will be easier to understand dsa.
@TAPACADEMY Жыл бұрын
Thanks man. Do subscribe to the channel for regular tips and lecture updates of the dsa course.
@Hmd_hk 6 ай бұрын
the way you explain things and make them look so easy is just amazing. keep up the good work man. loves from germany,.
@be-a-06-surabhibandabe56 9 ай бұрын
Great explanation
@bokinalavijay6876 10 ай бұрын
Thank you sir ❤
@hemambuja-dq6es 11 ай бұрын
I'm truly amazed by how wonderfully you explained this. Your explanation has left me in awe. Please continue to share your videos, sir!
@116_likhitawanjari2 11 ай бұрын
very nice and typemaster also greate.
@sanskritigupta4445 Жыл бұрын
beautiful explanation sir!!
@user-ik1dr8ud4h 6 ай бұрын
Amazing 🎉🎉
@abhishekkumar-xm3nj 11 ай бұрын
Sir the way that you are teaching its equal to that Gabriel lame algorithm that reduce reduce our time complexity and Save our data also , because after watching your video We do not have to open any other video Sir you have amazing communication skill. 🙏🙏🙏🙏
@aldricanto7724 Жыл бұрын
what about this code sir ? static int hcf(int x , int y) { if(y==0) { return x; } else { return hcf(y,x%y); } } public static void main(String[] args) { int x = 0; int y = 19; System.out.println(hcf(x,y)); } }
@yfjsdgzjdnfn Жыл бұрын
41:32
@devrajdpk Жыл бұрын
Oh my God!, such an amazing explanation. Your video was just recommended by KZfaq and I watch it from start to end. Thanks a lot, man.❤❤❤
@kaveridhore4398 Жыл бұрын
Best explaination! Thankyouu so much to make this a easy one
@TAPACADEMY Жыл бұрын
You're welcome 😊
@nidhisagar6810 8 ай бұрын
❤
@user-zf7hq4yk4c Жыл бұрын
just perfect in one word i can say u are!!!the way u explain omg xoxo
@poornacreations2403 Жыл бұрын
Excellent💯👏
@amansrivastav6885 11 ай бұрын
nice explanation
@abhalad2582 11 ай бұрын
yes we are able to think sir!!😀😀
@arbazahmadkhan9128 Жыл бұрын
Super se upar 👍🏻
@Hasan_770 Жыл бұрын
when calculating frequency 'i' value will be 'i--' (post decrement) not 'i++ '.thanks for this video sir.16:22/43:24
@manojkumarmahanta3879 Жыл бұрын
You are really awesome...... Please make a video of how to calculate LCM of an array
@TAPACADEMY Жыл бұрын
We have made a video on how to calculate LCM in our DSA course. You can use similar concepts.
@sharonjoe7535 7 ай бұрын
you are criminally underrated
@hrithikrudra4292 Жыл бұрын
Awesome 👍👍
@user-ux7xh5ji2e 11 ай бұрын
can you please explain how to understand the logic for leetcode and hacker rank problems. your explanation is very good and understand easily
@11csepratikshaargulewar71 Жыл бұрын
Sir ,it should be (log(max(a,b))) not O(log(min(a,b))) as this is a optimised version of Euclid algorithm only in gabriel lame algorithm
@Oneinlove123 Жыл бұрын
please upload 3 or 4 videos daily ..my humble request
@sagarhaldhar2151 Жыл бұрын
One day this channel will become A million followers channel Great work by you sir
@MPG_FSD-YT Жыл бұрын
Hlo bro
@satpalghorela4046 Жыл бұрын
// please calculate time complexity in this program . class gcd { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); int c; while (b != 0) { c = a % b; a = b; b = c; } System.out.print("the gcd is: " + a); } }