+ 2

Can't decide which project to take

For Algorithms and Data Structures we have to choose one of these topics: • Seperate chaining • Coalesced Hashing • Linear Hashing • Extendible Hashing • B+-tree I will have to do it in C++. The topics are in the order from _easiest_ to _hardest_ according to our lecturers. And from less to more points. Vote up for which one you would take or tell me positives and negatives about them.

26th Apr 2017, 2:07 PM
‎ɐısıօլɐ
‎ɐısıօլɐ - avatar
4 Réponses
+ 2
@Xander A. we have two months for it :D
26th Apr 2017, 4:37 PM
‎ɐısıօլɐ
‎ɐısıօլɐ - avatar
+ 2
OK Ich chose Coalesced Hashing
30th Apr 2017, 11:45 AM
‎ɐısıօլɐ
‎ɐısıօլɐ - avatar
+ 1
Choose the easiest so you don't need to spend all night on it.
26th Apr 2017, 2:45 PM
Xander A.
Xander A. - avatar
+ 1
@Alosia lmao Edit: Do the hardest to get more points.
26th Apr 2017, 4:59 PM
Xander A.
Xander A. - avatar