Tables index

From

Analysis of Complexity of Some Combinatorial Algorithms Using Halstead Metrics and Time Measures

Bashar Bin Usman, Ibrahim Abdullahi, Okeyinka Aderemi Elisha

American Journal of Applied Mathematics and Statistics. 2024, 12(3), 66-69 doi:10.12691/ajams-12-3-4
  • Table 1. Time measures for Greedy, Dynamic programming, and Branch-and-bound algorithms
  • Table 2. Halstead metrics for Greedy, Dynamic programming, and Branch-and-bound algorithms
  • Table 3. Time measures and Halstead metric (effort)