Arrays and Sorting Algorithms - Intro to Computer Science - Harvard's CS50 (2018)
video description
Date: 2022-03-14
Related videos
Comments and reviews: 9
Diwakar
David sir can u make complete series of lecture in c say 20 lecture and each lecture of 1.30 hours .......u r best in teaching ..u can refer jeery Cain from stanford university ...he has 27 lecture just on c and ....i have also seen stanford university Jerry Cain video lecture has 27 video just on c ,memory stack in c,malloc in c ......etc........
reply
David sir can u make complete series of lecture in c say 20 lecture and each lecture of 1.30 hours .......u r best in teaching ..u can refer jeery Cain from stanford university ...he has 27 lecture just on c and ....i have also seen stanford university Jerry Cain video lecture has 27 video just on c ,memory stack in c,malloc in c ......etc........
reply
Eliphas
I am now at the end pf second sem in my university but This is my second lecture counting from CS50- B, It took us the whole semester to learn what th guy taught in 2hrs. And FreeCodeCamp guys, Quincy and Company thank you is never enough
reply
I am now at the end pf second sem in my university but This is my second lecture counting from CS50- B, It took us the whole semester to learn what th guy taught in 2hrs. And FreeCodeCamp guys, Quincy and Company thank you is never enough
reply
StudyGuide
Sigh, sometimes i wish i did not go to college in canada. My professors are so low quality at the moment, they just zoom zoom through everything without explanations and tell us to research it our selves and not ask questions...
reply
Sigh, sometimes i wish i did not go to college in canada. My professors are so low quality at the moment, they just zoom zoom through everything without explanations and tell us to research it our selves and not ask questions...
reply
Sangwoo
This lecture is increadibly better than my uni's. The lecture is so engaging, fun and so clear. Meanwhile in my uni the lecturer dribbles incoherently over videos used in the past semesters smh
reply
This lecture is increadibly better than my uni's. The lecture is so engaging, fun and so clear. Meanwhile in my uni the lecturer dribbles incoherently over videos used in the past semesters smh
reply
Arootin
Just the fact that you added -and Sorting Algorithms- to the title helped me find what I needed. wonderful class and teacher. thanks for the upload.
reply
Just the fact that you added -and Sorting Algorithms- to the title helped me find what I needed. wonderful class and teacher. thanks for the upload.
reply
Muhammad
Hi, right now we are already given easy function, like upper lower, but can we really need to understand behind the function is? thanks alot
reply
Hi, right now we are already given easy function, like upper lower, but can we really need to understand behind the function is? thanks alot
reply
Wass
to convert chars to integers you can do that :
--- char c = 'a'; // narrowing on C-
int a = c; // instead of int a = (int) c;
---
reply
to convert chars to integers you can do that :
--- char c = 'a'; // narrowing on C-
int a = c; // instead of int a = (int) c;
---
reply
Tim
This guy is the best. I can rarely pay attention to youtube tutorials for >5 mins. This guy has me zoned in for 2 hours at a time.
reply
This guy is the best. I can rarely pay attention to youtube tutorials for >5 mins. This guy has me zoned in for 2 hours at a time.
reply
Ty
That chair demonstration was excellent. I could almost visualize the code in my head, good way to think about the logic of sorting.
reply
That chair demonstration was excellent. I could almost visualize the code in my head, good way to think about the logic of sorting.
reply
Add a review, comment
Other channel videos
