So far I have been talking more with my group. Our initial idea for a hash table has been scrapped, and we thought about using a ternary search trie. An issue though was wondering how we could balance this ternary search trie. I also thought this could be confusing for the remote team doing the implementation. So I proposed a red black tree, which can be easy to know how to balance and also is not too hard to implement. Hopefully, the rest of my group likes this proposal.
I have been talking with Lisa the most about these ideas, and I recently have been talking to Jose, who has recently got a new job. I have emailed Jackson twice and been posting on piazza, but I have not heard from him yet.
I’ve been writing some pseudo code on the design of a red black tree bucket, and my hopes are that I will finish writing the rest of the pseudo code by tomorrow. I also hope that I can get communication from Jackson soon, so that we can coordinate better as a group.
No comments:
Post a Comment