- Видео 7
- Просмотров 24 416
Jat in the box
Добавлен 21 окт 2020
Practical introduction to runtime complexity and Big O notation
Explains why binary search is so much faster than linear search.
Просмотров: 115
Видео
Factorising quadratic equations where coefficient of squared term is not equal to one.
Просмотров 1053 года назад
Video includes worked explanation of why the trick of multiplying 'a' by 'c' helps in factorising quadratic expressions (ax^2 bx c). The terminology is a bit wonky in places (I keep saying equation when I mean expression) and it is all very "hand wavy" and I gratuitously use the word "proof", but my kids found it helpful - or maybe they were being polite :-)
Making 500ml of 1M Hydrochloric acid from 36% Hydrochloric acid
Просмотров 5313 года назад
This video details, how much 36% HCl acid and how much water is required to make 500ml of 1M HCl acid. I am teaching chemistry, at home, to my 12 and 11 year old boys and this is the first in hopefully a series of videos on what I am covering with them. The video is both theoretical and practical and covers working with moles, volumes and masses of reagents and how to convert between each repre...
Try and Catch joke and References vs. Objects in Java
Просмотров 1083 года назад
Java, Yoda, joke, references, objects
Dynamic stack visualisation and implementation in C with a linked list
Просмотров 1 тыс.4 года назад
This covers stacks using linked lists in C at a high level and a low level. Structures, pointers, malloc and free are all covered in some detail in the course of the lecture.
Dynamic 2d array allocation and deallocation in C
Просмотров 22 тыс.4 года назад
Code explanations and diagrams illustrating the use of pointers, malloc and free to allocate and free memory for a two dimensional array on the heap
What an explanation! Thanks a ton man.
You are a good teacher, thank you! I was struggling with this all day
It was a coincidence, that I found this video. When I tried to find 'Jat in the box' inside RUclips, I got nothing related to that. I had to use DuckDuckGo and it find it immediately! A suggestion, I don't know works, the title maybe could have 'Jat in the box - advanced C' Anyway, I hope you will make more advanced C videos - please. :o)
perfect. the only one that explained clearly so far.
thank you man, you save me from my upcoming test, thanks a lot
TE AMO GRACIAS !!!
Thank you so much for the explanation!!
Thank you so much man! This was great.
Excellent explanation
perfect video
why did u stop posting ? 😥
Just wasn't much interest 😔
Dude is a GOAT. As a grad student taking a CS class (non cs major) this has made it extremely clear how to allocate dynamic memory. Thanks!
Very informative 🔥
I know I'm a bit late to the party but goddammit that explanation is so good. pleace don't stop doings vids like this you've made a difference in someone's life
ur divine
man thank you so much this video I find it the best one on RUclips ♥
this is the one
Nice explanation! However there's an optimized way to allocate a 2d array int **p = (int **)malloc(rows * sizeof(int *)); p[0] = (int *)malloc(rows* columns * sizeof(int)); for (i = 1; i < rows; i++) { p[i] = p[i - 1] + columns; } free(p[0]); free(p); In this case, a single block of memory is allocated and rearrange the pointers to form an array. This is computationally better for a few reasons: 1. The allocation engine does not perform as many allocations as before. 2. As opposed to the conventional implementation, there's no extra bytes between rows to keep count of the memory blocks. That means the final 2d array is represented in a continuous memory block. Therefore, there's no need to make large moves between those positions in the memory. 3. free() is called twice only. The conventional implementation depends on the 'rows' size.
This is a life saver. Thank you!
exactly what I needed :) I'm working on a small project that solves a system of user input equations and this is the core of it
Wow ! Great explanation, i'm french and your english is very understandable ! Thanks a lot !
Amazing explanation way more clear than my college professors
This has been the most easy -to-understand tutorial ever since. Thanks a lot. Just a little something : on function free2dIntArray() we shouldn't include the third parameter dim2 on the function's prototype.
Thanks for your kind words and yes you are correct.
Thank you, this was an approachable explanation that helped me finally understand the concepts.
Very good explanation sir it's a superb video. Everyone can understand this concept without any doubt.
please you are amazing , thnks a lot and you have made my difficulties become simple for me 💯🙏🙏
thank you for the effort creating this wonderful video
B E A U T I F U L EXPLANATION
best explanation , keep it going !
why is (int**) debatable? is there something wrong with using it? thanks!
You just do not need it, but I think it makes the code more readable. I think it reminds people of Java, which they do not like, but I do 🙂
make more videos please
thanks a lot that was quite helpful.
To be honest, this is the most comprehensible explaination on youtube, thank you so much !
I feel like I don't need to know this for the problem set I'm doing, but this was very helpful regardless. Thank you!
legend
Can you please make complete knowledge of c/cpp, You are way of teaching so good and you really get us into deep which really i want !! Thanks for this video 🤠
Thanks for your kind words Zuned. I'll try and upload some other material soon.
@@jatinthebox8574 willwait for more.
this video is so good!Thanks!
you're a fuckin lifesaver, man
i love this
Great video to help shake out the cobwebs. My favorite on RUclips for the topic. Thank you!
It would have been nicer if you give meaningful names to parameters like instead of Dim1 Dim2 you can could have written Row and col, in video you are mentioning them as row and col why not name them the same.
thank you sir!
I went in with no expectation, I finished with complete understanding of what I should be doing, and also a slightly better idea on pointers/array. Thanks a bunch, appreciate your work greatly.
This was gem
Clearly understood! Thank you sir.🙇
Best video on this topic !! Thanks alot.
Thank you very much for this wonderful content.
thank you sir.
Actually the true dynamic 2d array can be allocated with a pointer to array. Just do `int (*arr)[dim2] = calloc(dim1, sizeof *arr);`. And that's all. Just remember to call `free(arr)` at the end.
That's a really neat way of doing it. Do a video to explain how it works ? ;-)
@@jatinthebox8574 sure sir
Strictly speaking isn't this a lookup table not a true contiguously allocated 2d array?
As you say, it is not contiguously allocated 2d array: each row will be allocated to separate locations on the heap. Also, I get what you mean by lookup table: the "column array" of pointers to integers are used to "look up" each row. I wouldn't personally call it a lookup table, though. For me they (lookup tables) are a higher order construct used for a smaller set of specific applications.