And why randomly by the way ? Is there a logically thing to do there ? You see, I don't know how to proceed.
#Best bookmark sorter update#
Then what ? Does that mean I simply update the rank to b.rank = a.rank - 1 (lower the more important it is). Say I present 2 random tasks, and that the user says that B is more important than A and stop there. The sexy/playing part is up to me, but I have a hard time finding a way to logically (algorithmically) present tasks and then order them, giving that the user can stop this process at anytime. I'd like to have a sexy interface where tasks are presented, and the user could play while doing his review. The ultimate goal is keep tasks ordered by priority. The more I think about it and what is my goal is (asking this question of this algorithm), is that I want to make it fun to do the tasks review. I wonder for example how the agile review meetings are held. I realize that I maybe have first focused on this problem on the software level (asking for an algorithm) but my question is maybe belonging more to a project management group.It is sometimes very useful to prioritize a task belonging to a not so important feature placed later in the queue. I prefer a flat backlog with tagged tasks. I do not want to have a tree of tasks classified by features and lose the flat list.I agree that priorities can also be set by features and at the task level. We already have tags, but a tasks review is there to determine priorities among them.Yes, each tasks have responsibles and each responsible can order all (thous their) tasks.Thank you very much for all this feedback ! (or way of presenting the tasks and questions) in order to speed up Do you have a better strategy to propose.What is the best algorithm that reduce the number of comparison.The tasks already have a initial rank already set by the user by hand that represent the priority.
0 kommentar(er)
