hey, brother, I am from Tanzania, you are genius, this was one of difficult part in my c++ class but now see no more cramming, god bless you , programing is not difficult unless you meet wrong teacher, big uppppp
Who does this, who explains a code like this so simply and effortlessly , it's all we need as students ,to get the logic and being able to explain it ourselves to the layman on the street, you explain these algorithms better than my professor, thanks a lot.
If you use int max = 0 instead of int max = arr[0] in your code, it might not work correctly in all cases, especially when the array contains only negative numbers. We can't consider 0 as a least element , if we are using arr[0] we are comparing with first element of array.
please tell me checking the divisibility of 11 without using num modulus 11. for example 20449 is divisible by 11. logic is sum of digits at odd places is 2+4+9 =15.sum of digits at even places is 0+4 =4. . sum at odd places - sum at even places is 0 or 11 0r 22 or things like that then the number is divisible by 11. I think that it should be implemented by using arrrays. another point to be noted is that we can use modulus to separate the digits of the number from the back by using the logic of sum of digits of a number. i will be highly obliged.
pleaase help me on this (only single-time scanning values while so sorting arrays) question: input arr =[1,0,2,0,2,1,3,4,5] output:[0,0,1,1,2,2,3,4,5] but Here only single scanning not repeating the array elements comparison while sorting the array
Hello Sir i just love your videos... make video on following topics...as u miss it out 1.TSP(Dynamic approach) 2.TSP(Branch & bound) 3.and most imp np hard and np complete problem
given a array DATA with N numerical values, this algorithm finds the location LOC and the value MAX of the largest element of DATA in data structure (solution for this question)
Waiylt but wht if all nos r negative this will give 0 as output which is not even present inthe array My suggestion is insted of max = 0 keep max = arr[0]
Yeah, was wondering the same. Do you got any idea to generalise this for an array containing positive and negative numbers both. I am new to programming.
Khyade sir is the best
Great video. It’s sometimes difficult to turn your idea into code. This was well explained and way more simple than my solution. Thank You.
Sir , it is difficult to understand me this algorithm . But after watching this Videos , I easyly understand the logic . THANK You sir
th-cam.com/video/oa1ziyOP63Y/w-d-xo.html
Indian programmer always save the world
👍👍👍
Fr
hey, brother, I am from Tanzania, you are genius, this was one of difficult part in my c++ class but now see no more cramming, god bless you , programing is not difficult unless you meet wrong teacher, big uppppp
jambo rafiki ni msawusa(south african)
Mcbc
😂😂😂kmmke
Mambo vipi brother am from Uganda, and a software engineer we should be friends
i don't know why i couldn't figure this out on my own, but this made me understand what I was doing so well. Thank you so much.
Exactly
Who does this, who explains a code like this so simply and effortlessly , it's all we need as students ,to get the logic and being able to explain it ourselves to the layman on the street, you explain these algorithms better than my professor, thanks a lot.
th-cam.com/video/oa1ziyOP63Y/w-d-xo.html
im so grateful i now understand arrays better than before
happy for you,i as well
Jesus loves you
He's the son of God
Believe in him and repent
Your way of teaching is good I was confusing now I am clear.
I really appreciate the way you teach............keep up ur good Job!
If you use int max = 0 instead of int max = arr[0] in your code, it might not work correctly in all cases, especially when the array contains only negative numbers. We can't consider 0 as a least element , if we are using arr[0] we are comparing with first element of array.
Clean comprehensible code. NICE!
you are the top thank you very much sir you saved my semester. God bless you
well done sir , you just simplify the concept , Thats the quality of a good teacher........
Good bless you.......🥰🥰🥰🥰🥰
I enjoyed this video because the logic was explained in detail and simple demonstrating each step. For that, I subscribed.
Very clearly explained... Bravo Sir
Thnku so much sir 😊😊you explanation is too much good 👍
Keep watching
Thanks a lot sir I really confused about this program but now I understand it well thanks again stay blessed
thankyou so much Sir. I am so confused but after watching your video I got it. thankyou Sir.
what is meaning of--- o(n) time complexcity, sir.
thankyou mister, it's so understandable
love your content. keep going!
A good one ,can i find a video on passing arrays to functions
What a great and easy explain sir, thank you ❤
very nice explained. thank you
Very Understandable... Hope you can make lots of videos it's really helpful ❤️❤️❤️
Hi ,how to find out the maximum 10 values in array in one column of about 100 rows and how to right it in metastock thanks
please tell me checking the divisibility of 11 without using num modulus 11. for example 20449 is divisible by 11. logic is sum of digits at odd places is 2+4+9 =15.sum of digits at even places is 0+4 =4. . sum at odd places - sum at even places is 0 or 11 0r 22 or things like that then the number is divisible by 11. I think that it should be implemented by using arrrays. another point to be noted is that we can use modulus to separate the digits of the number from the back by using the logic of sum of digits of a number. i will be highly obliged.
How to draw the Flowchart of this algorithm?
great explanation sir thankyou
Please help me on this question "Finding the duplicate numbers in an array of 10"
Very great explanation ❤
Great explanation!
pleaase help me on this (only single-time scanning values while so sorting arrays)
question: input arr =[1,0,2,0,2,1,3,4,5]
output:[0,0,1,1,2,2,3,4,5] but Here only single scanning not repeating the array elements comparison while sorting the array
very help full video , keep it up sir
Thank you sir for explaining properly.
Hello Sir
i just love your videos...
make video on following topics...as u miss it out
1.TSP(Dynamic approach)
2.TSP(Branch & bound)
3.and most imp np hard and np complete problem
th-cam.com/video/oa1ziyOP63Y/w-d-xo.html
I love it you teach so well sir🙏🙏😌
given a array DATA with N numerical values, this algorithm finds the location LOC and the value MAX of the largest element of DATA in data structure (solution for this question)
Thanks alot sir i was having difficulty with this program but after watching your video i got the idea how to do it
thanks :) .. very clear explanation. Do you have a website ?
You are very good brother
Hi sir, while I am taking max= 20 ( randomly bigger number) output is not changing. (Its bigger number presented in array) how this is happening???
nice bro
Create a program that stores 20 numbers into a multi dementional array and find the largets stored number
Wow ur teacher is nice
Fan from Guadalajaran, Mexico. How to find the largest number in a matrix?
Write a program to find the maximum and minimum of an array of 10 elements of user given array
Can you write it sir?
Thank you so much this indeed clear and well thought, Also like we can solve this with mathematical way right which makes the process way easier.
Hi pls explain the algorithm to reverse array element using temp variable
Thanks sir please make more videos!!
very good explanation. so perfect
Thank you so much very well explained. Keep it up!
You are welcome!
nice video thanks
sir, how to write algorithm to find the largest value in array by recursion
Search on Google
Waiylt but wht if all nos r negative this will give 0 as output which is not even present inthe array
My suggestion is insted of max = 0 keep max = arr[0]
please upload a video on finding minimum element
Well explained sir
thanks for explanation sir
Thanks sir from USA
How can I also print the location of the max
plz share divide and conquer (recursion) method for finding max element
Excellent vid :)
If each element is
Yeah, was wondering the same. Do you got any idea to generalise this for an array containing positive and negative numbers both. I am new to programming.
use max=array[0] instead
You are the best. I would like videos on EULER , AND HAMILTON theory!!!!
Please also make algorithm on second largest
Tq sir,, understood easily
Please do pattern program also please.... If u have already dun please share the link
Sir plz make the video of c program/algorithm to interchange largest and smallest number in an array using function
Thank you ❤️
Thnks very useful
Make video on array rotation problem
Already there on channel
Please or video daliye simple question iteration ki
Sir i request to u plzzz make 1 video on reversing for loop . How to reverse stack.
th-cam.com/video/oa1ziyOP63Y/w-d-xo.html
thank you
You're welcome
salamat idol
Hi Sir, why do you max = 0?
please do a video on kth largest/smallest element in an array...
looking for that
Thankyou 😊
Thank you
Thank you!
Subscribed :)
Thank you sir😊😊😊😊😊😊
sir please make a video on graph
Here how we can store the maximum element into another variable like x
Superb👍
Kindly make video on Graph.
sir tuse great ho
but there is a problem when we choose -ve integers then it will return 0 as the max element
Can you explain the question more
thanks u so much
Thank you Teacher
sir make videos in hindi...it will be very helpfull...and there are more chances of video to reach to every one
You think that national language is Hindi,baka come to sense
Thanks
Thanks sir
Super sir❤
Thanku sir❤
thank you sir
Check if there is only one element in the array
😮❤❤
Beacuse code understand some time not run so provide code link and show last time in vedio code in id
thanks sir
🥰