Congrats you're nearly halfway through! Keep persevering, be positive and all the best for completing the course!

Arrays - Insertion is bad. Lots of shifting to fit an element in the middle (inserting at the end is not as bad). - Deletion is bad. Lots of shifting to fit an element in the middle. - Lookup is great. Random access, constant time. - Relatively easy to sort. - Relatively small size-wise. - Stuck with a fixed size, no flexibility. Linked lists - Insertion is easy - just tack onto the front. - Deletion is easy - once you find the element (change a few pointers, then free a node). - Lookup is bad - have to rely on linear search. - Relatively difficult to sort - unless you're willing to compromise on super-fast insertion and instead sort as you construct. - Relatively small size-wise (not as small as arrays). Hash tables - Insertion is a two-step process - hash, then add. - Deletion is easy - once you find the element. - Lookup is on average better than with linked lists because you have the benefit of a real-world constant factor (imagine having your data broken down into multiple linked lists). - Not ideal if sorting is the goal - just use an array. - Can run the gamut of size (depends on how many buckets there are). Tries - Insertion is complex - a lot of dynamic memory allocation, but gets easier as you go. - Deletion is easy - just free a node. - Lookup is fast - not quite as fast as an array, but almost. - Already sorted - sorts as you build in almost all situations. - Rapidly becomes huge, even with very little data, not great if space is at a premium.

It is taking me a lot of time to go through the problem sets now but I won’t give up.

Man I really love the shorts and Doug's teaching, but damn the intros are way to loud.

C is coming back as a vintage language that hipsters program in.

There are fewer and fewer people as you go through the course. Sad

This was a good summary!

I do not get people who says CS50 covers too much too quickly. Dude you have 1 year to finish course compared to me - 2.5 month. I have to submit certificate by the end of 2020 which means each week I have to complete each week assignment and I work at the same time. I would love to explore merge sort and algorithms more, memory and whole C but I simply do not have time. You on the other hand before jumping to next week, you have time to explore fully the topic of each week. I am not coding genius and probably not even mediocre pseudo coder but even if I am able to finish these assignments you are able to. Take your time. I struggle a lot but in the end I find a way to make my code work. Maybe it may be more efficient but I am beginner. If it works it works. And mind that everything you need to complete assigment is in the course and Doug's videos.

It would've been better had it been arranged in the form of a table of sorts

Thx Doug

Thanks

Regarding Linked lists, I think there is a contradiction. You say the search is quite complicated. However you say that deletion is simple; yet to delete an item you must first search for it. Is there something I don't understand?

thank you!