Видео

for those still struggling to get a deeper understanding, hopefully it being expanded can help; x = x + y y = x - y x = x - y is really x = x+y therefore, with substitution y = (x+y)-y = y and x = (x+y) - ((x+y)-y) = (x+y) - ((x)) = (x+y) - x = y its taking the fact that if we turned one of the values into a sum of both, we can always get that information back by subtracting by the other variable, and vice versa x+y-y=x x+y-x=y so once we change x into x+y, we can set y to the same but with it being subtracted by the value it's storying, so we get x = x + y y = x which since it works vice versa, we can do the same operation like it never changed since the last state, only switched, subtracting x by the y

Nice explanation ❤

Detailed explanation....

😍Love From Pakistan .Sir i always use your videos for increasing my knowledge .I also learn C++ on your Channel your way of speaking and talking and conveying msg is just amazing love you sirr🥰

bro can you start talking in hindi we dont undderstand properly

Excellent Tutorial

I am facing an error when i compile and run the code i.e reference to 'distance' is ambiguous

just wooooooow , amazing explanation 🤤

sir 6,6 does not satisfy the equation x+y>= 16 so it has been neglected but how we can analyze that from the graph without actually putting it in the equation , btw very nice playlist as well as explanation

BEST VIDEO ON THIS TOPIC EVER!

main switch(menu()) { case 1: cout << "Enter value: " ; cin >> value; if(!q.isFull()) q.enqueue(value); else cout << "Stack is Full" << endl; break; case 2: if(!q.isEmpty()) cout << q.dequeue() << endl; else cout << "Stack is Empty" << endl; break; class ///////////////////////////////////////////////////////////// void enqueue(int val) { if(front == -1) ++front; arr[++rear] = val; } ///////////////////////////////////////////////////////////// int dequeue() { int val = arr[front]; arr[front] = 0; if(front == rear) front = rear = -1; else ++front; return val; } //////////////////////////////////////////////////////////////

When we create methods it is in the responsibility of the user (programmer) to make good use of those methods. For example, since you implemented the isEmpty() and isFull() methods, it is better to use them (in main method) before calling the enqueue and dequeue and not use them inside methods. example in class ///////////////////////////////////////////////////////////// void enqueue(int val) { if(front == -1) ++front; arr[++rear] = val; } ///////////////////////////////////////////////////////////// int dequeue() { int val = arr[front]; arr[front] = 0; if(front == rear) front = rear = -1; else ++front; return val; } ////////////////////////////////////////////////////////////// in main() case 1: cout << "Enter value: " ; cin >> value; if(!q.isFull()) q.enqueue(value); else cout << "Stack is Full" << endl; break; case 2: if(!q.isEmpty()) cout << q.dequeue() << endl; else cout << "Stack is Empty" << endl; break;

6-7 years old playlist , still worth it....!

I'm encountering an error with the 5th use case and the corresponding code. The main method is defined inside a class named TestThis7, which seems to be causing the issue. If I remove the TestThis7 class entirely, the code executes without errors. Am I misunderstanding something, or is there a specific reason the main method is inside a class? I'd appreciate any help in understanding this. Thanks!

Thank you, excellent explanation

Can u please add tower of Hanoi too

This dude is teaching it for 5 years 💀💀

thank you , you are great

Thank you sir

This was very much helpful. God bless you ! You probably have to post more.

Thank you sir 🙏❤

The best

Well explained!! Thank you👏

Good

This is very helpful thanx alot

The intro is diabolical

thx , the code which you provided isnt the same code you write it in the video

this 4 minutes 28 secs is all I ever needed

Excellent Explanation , Thank you very much

amazing

YOU ARE GREAT

Og bro

Hats off, no one in youtube has explained this concepts so thoroughly💯

Thank you sir , well explained

Best Explanation Thankyouu soo much❤❤

MashAllah very beautiful method of teaching ❤.

For some reason I am getting an error at my mergeSort member function the erro reads expected unqualified-I’d before ‘{‘ what could this mean

❤❤❤❤

try with recursion please

❤❤❤

❤❤

❤❤❤

Thankyou

❤❤❤❤❤❤

Very nice and easy lecture

thank you so much teacher, it helps me a lot❤❤❤

Anyone from bsc cs?

sisters and their brothers. why I'm getting puzzled

max keys per node is 2 * degree - 1 and minimum keys per node is degree - 1

Your videos are soo good i am following through now. I am stuck can you please help the bootstrap card is not showing its border.