More importantly does that mean people can be ordered by that and can we construct a binary search tree to find anyone with a specific value of gay within O(log_2(n)) time?
If and only if you can define “gay” on a one dimensional axis, otherwise it would be like plotting points on an N-dimensional graph, I’m pretty sure “gay” is a multiple dimensions thing.
More importantly does that mean people can be ordered by that and can we construct a binary search tree to find anyone with a specific value of gay within O(log_2(n)) time?
If and only if you can define “gay” on a one dimensional axis, otherwise it would be like plotting points on an N-dimensional graph, I’m pretty sure “gay” is a multiple dimensions thing.
So sadly we wont be getting a
tree: BinaryTree<Person> = BinaryTree::new_sorted_by(order_gayest);anytime soon 😒
Surely you’d need a non-binary tree?
Bruh i wish, 2-3 trees or anything of the sort probably won’t help us 😔
✨ The Forest of Gay ✨