search

vishnuravi / invitable

App Invite Sharing Service
GNU General Public License v3.0
13 stars 2 forks source link

Queue Position Location Algorithim #26

Open frankcash opened 9 years ago

frankcash commented 9 years ago

I propose that the queue looks like [[n+x][n][n-x][0]] where n=invites given/invites received

mohnjoosemiller commented 9 years ago

There needs to be some weighting for the actual usage. basically, we don't want someone with a 2given/1 recieved to be ahead of a 40 given/25 recieved.... net balance might be good (given-recieved)

frankcash commented 9 years ago

okay so [x0 > x1 <- [[n+x][n][n-x][0]]] where n=invites given/invites received and x0, x1 = user's net balance

mohnjoosemiller commented 9 years ago

^I'm confused..... what do x0 and x1 represent... confused on the difference between.

frankcash commented 9 years ago

x0 and x1 == user 0 and user 1. So in other words the user before you should have a higher net balance but only if their ratio is higher than yours.

mohnjoosemiller commented 9 years ago

:+1: I like it... definitely something along that theme, though the actual way we weight it may need to be shifted, this is the right way to go for sure.

frankcash commented 9 years ago

@bltsandwich1 I'd like to not have to change later on though, so yeah... let's try and make this is a done once type of thing :dart:

frankcash commented 9 years ago

Probably better to do the rest of this on the front end so not to mess with the server load

A front end merge sort would definitely be a lot easier than me messing with all this data on the server in case we receive a lost of requests at one time.