TABLE 9.
Cyclomatic complexity and time complexity performance comparison.
| Algorithm | Cyclomatic Complexity | Time Complexity |
|---|---|---|
| DIMASS | 2 | O(n) |
| Lévy flight (Chawla and Duhan, 2018) | 3 | O(n) |
| Parallel track (Bevacqua et al., 2015; Jensen-Nau et al., 2021) | 7 | O (n 2) |
| Creep lining (Bevacqua et al., 2015; Jensen-Nau et al., 2021) | 9 | O (n 2) |
| Sector search (Bevacqua et al., 2015; Cabreira et al., 2019) | 11 | O (n 2) |
| Expanding squares (Bevacqua et al., 2015; Cabreira et al., 2019) | 7 | O (n 2) |
| Zamboni search (João, 2012) | 7 | O (n 2) |