10:30 : why are you using free(entry) ? entry was not created with malloc in the constructor
@philipphortnagl2486 Жыл бұрын
thanks for these videos. Hope you come back anytime soon with new projects and tutorials!
@BabyBalla3score3 жыл бұрын
jeez louis. Just started "learning" C this weekend by doing last year's Advent of Code and wanted to implement a dictionary. I paused the video at 9:04 and googled for a good 15 minutes why you were placing the function declarations in the header file. The next words to come out of your mouth were regarding that very subject lol
@eom-dev3 жыл бұрын
haha honestly I do that all the time with KZbin tutorials!
@RichardLRogers3 жыл бұрын
Thank you. Kind note - larger font could be helpful for easier viewing/following.
@sau-da-de3 жыл бұрын
That Washington OOP in C paper is really good
@jahoopyjaheepu4977 ай бұрын
Well-presented and well-spoken, thank you
@MrSomethingdark2 ай бұрын
a rarity after the Indian takeover
@bonehelm Жыл бұрын
Hmmm. The advantage of a dictionary style data structure is to make access of an element O(1). So using a binary search tree instead of a hash function defeats the entire purpose. You're simply adding syntax sugar on top of a binary search tree.
@itspurelypassionate2 жыл бұрын
27:45 I don't understand how it converts a void pointer (result) to a struct Entry pointer. how does it work? I am confused. struct has 2 pointers but result is only one pointer so i donno how it is possible to cast it. Very in depth tutorial though 👍
@shahil__malik96333 жыл бұрын
I came to watch this video as I'm stuck with my college programming homework
@eom-dev3 жыл бұрын
I hope it was helpful!
@shahil__malik96333 жыл бұрын
@@eom-dev yes, It was .but, you're doing some complex programming. I am a beginner level programmer.
@OhhBabyATripleАй бұрын
Great vid
@markuscwatson2 жыл бұрын
Nice job Eric
@alirezabahrami34010 ай бұрын
If you use hashmap it will be O(1) for search why do you find O(long n) more efficient? P.s: i have not watched until the end yet
@draco5991rep2 жыл бұрын
This IDE looks cool, which one is it and how hard is it to get familiar with it? Using Code::Blocks at the moment but I am not sure how happy I am with it, so I constantly looking for other interesting IDEs to toy around with until I find the one that fits me the most.
@AlanStreams2 жыл бұрын
xcode
@AlanStreams2 жыл бұрын
@085Pushpraj Singh Pawar xcode
@ed63933 жыл бұрын
Have you considered using hashing for your dictionary? It would be faster than a bst based implementation.
@eom-dev3 жыл бұрын
I though of using a hash table but wanted to make a more custom object. Eventually, this lets me add additional functionality; for example, I added a list of keys to the dictionary off camera that allows me to do something akin to a "for each" statement in a loop.