Thank you for your help. I was trying to create a matrix class and your video helped a lot

I love you

I don’t know why u give up upload video please come back

heading off to part 2😃

Thanks for this video but I don't understand it as the other two

Prior to figuring out how to use (or actually implement) this, I wished there was a part 3, but however I did figure out how to actually assign elements to the array and reference them. So basically, here's how you initialize and insert values into the matrix and print them: int main() { Matrix mat(2, 2); mat.getRow(0)[0] = 1; mat.getRow(0)[1] = 2; mat.getRow(1)[0] = 3; mat.getRow(1)[1] = 4; for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) cout << mat.getRow(i)[j] << " "; cout << endl; } return 0; } Output: 1 2 3 4 Thank me later (I followed along and changed my structure from float to int, so obv you would be assigning floats instead of ints). You could also probably add print() to the class recipe. - Matrix mat(2,2) initializes the matrix as a 2x2. mat.setSize(int row, int col) probably works, but I haven't tried it and prefer not to. - Right after that is code structured in a way to demonstrate the insertion of integer literals into the matrix. mat.getRow(r)[c] would basically be the same as mat[r][c] for a 2D array (or int**). I do wish there was a more concrete way we could insert elements into the matrix, but we must settle with referencing mat.getRow(int row) or mat.getColumn(int col) as 1D (or float*) arrays to insert what we want into them. There are probably other ways to do this but I'm moving on with this method for my needs.

this video did not do what it said it would

Thanks for this video!

Thank you for covering this. Very helpful.

This is 6 years ago, but the content is still relevant. Thank you for covering this. This is very helpful

open worksheet pls

really. how to make opponent?

can you please share the C++ codes?

For anyone trying to learn the MergeSort algorithm,the complexity of the algorithm should be O(n), and by using selection sort you make it O(n^2). So there is no point learning this algorithm because it's the same as using bubleSort or SelectionSort only. And bubleSort is 10 times easier to learn than this.

I can't find part 3. Can someone point me to it. Thanks for the great video

I learned more from this 20-minute video than I have from my professor over a week. Thank You!

I LOVE YOU

I'm just starting my journey into c++...as my first project I intend to make a choose your own adventure style story...thanks for this, it helps me realize how it all FITS together...

I have to say this was the most informative tutorial I have watched while I have been learning C++!!! Thank you!

famoc a mammt

time complexity of this is n squared, merge sort should be nlogn This isnt merge sort

where is part 3

10/10 thank you vrey much

can you help me on my c++😁

Where can I find continuation of this algorithm

there's a kindness in this video..thank u

error C2039: 'alloc\dealloc' : is not a member of 'Matrix' error C3861: ''alloc\dealloc': identifier not found

you are so dope

Hi! im truly thanks you for make this video! i've learned a lot! can you send me the code to my email? if you have time. [email protected]

this video has 4k views still like no one actually clicked like... wtf ppl???

thanks you helped me advance in my exam preperations omg thank you again

how would i be able to integrate a class that puts a class function so i may generate random numbers from and plug them into automaticaly generated array?

please do not waste your time. completely wrong implementation

plenty of errors

#include <iostream> using namespace std; //program to guess a number chosen by user int main() { //variable definitions int number; char answer; //defines constants int MAX = 100, MIN = 1, MID = (MAX + MIN)/2; char yesno = 'y'; //while loop to ensure program can run again if user wants while (yesno == 'y') //while look condition is if yesno is y loop if not end { //initial average cout << "Guess a number between 1 and 100. "; //asks user to think of a number between 1 and 100 cout << " Then enter one of the following values: h - higher, l - lower, c- correct."; cout << " Is it " << MID << "? (h/l/c): "; // asks user if average is correct cin >> answer; //algorithm for guessing number while (answer == 'h' || answer == 'H' || answer =='l'|| answer =='L') { switch(answer) { case 'h': case 'H': int NEW_MIN; NEW_MIN = (MID + 1); int NEW_AVE; NEW_AVE = (MAX + NEW_MIN)/2; MID = NEW_AVE; MIN = NEW_MIN; break; case 'l': case 'L': int NEW_MAX; NEW_MAX = (MID - 1); NEW_AVE = (NEW_MAX + MIN)/2; MID = NEW_AVE; MAX = NEW_MAX; break; case 'c': case 'C': answer = 'c'; break; default: break; } cout << " Is it " << MID << "? (h/l/c): "; // asks user if average is correct cin >> answer; } cout << " Great! Do you want to play again? (y/n): "; //prints the question cin >> yesno; //assigns yesno to value entered MAX = 100; MIN = 1; MID = 50; cout << " "; } return 0; //returns 0 from original main function }

and what about part 3?

It would be better if you just posted the code in the description. I tried typing it out, but I made too many errors and it was too much work to scroll through your video to see which lines I've got wrong.

plz i need this code plz

Hi great tutorial can you pls make detailed video on recursion and backtracking by teaching with some examples.

hey the time complexity of you algorithm would be O(n^2) which is as simply suing selection sort on the whole thing!

I tried to write a code but function for two pairs is not working, it gives the output just as a pair. what might be the missing part??

Thank You. Beautifully explained.

OOP ist not necessary for blackjack

How you can declare an array of variable size? int array1[half1];

Thank you! Your videos for this class are so helpful! I've been taking the same course material online at my college, but the professor hasn't been very available to explain things like you do.

You need to upload part 3! man...

This is was a very good video! but when you swap the indexes of the new min element and the current index you used array[minIndex] = array[start]; shouldnt it be array1[minIndex] = array1[start]?

Hello Michael I did not see the header file? And is there part 3 too?