Skip to main content
. 2022 Apr 5;8:e880. doi: 10.7717/peerj-cs.880

Table 1. Bin packing time complexities and worst-case approximation ratios.

Algorithm Time R A
NF O(n) 2.0
FFD O(nlogn) 1.222
BFD O(nlogn) 1.222