Binary priority list
Binary priority lists are a method of prioritization of software requirements. The objectives (or tasks) to be prioritised are successively added to a binary search tree, which defines a total order on the objectives. That is, it is a tree sort applied to software requirements, where the product manager's intuition about relative importance is used as the comparator function.
Applications
Binary priority lists have been applied to the prioritization of software requirements,[1] and have been considered a feasible approach for small prioritisation tasks not exceeding 100 requirements.[2]
Notes
Bibliography
Karlsson, Joachim; Wohlin, Claes; Regnell, Björn (1998). "An evaluation of methods for prioritizing software requirements". Information and Software Technology. 39 (14–15): 939–947. doi:10.1016/s0950-5849(97)00053-0. ISSN 0950-5849.
Bebensee, Thomas; van de Weerd, Inge; Brinkkemper, Sjaak (2010), "Binary Priority List for Prioritizing Software Requirements", Requirements Engineering: Foundation for Software Quality, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 67–78, doi:10.1007/978-3-642-14192-8_8, ISBN 978-3-642-14191-1, retrieved 2023-07-21
This article "Binary priority list" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Binary priority list. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
