Skip to main content
# Table 9 Comparison of algorithm complexity

GIT algorithm | |
---|---|

Steps | Complexity |

Storing and creating sequence relations of activities (Table 4) | \(O\left( {n^{2} } \right)\) |

Creating invisible prime tasks (Table 5) | \(O\left( {n^{2} } \right)\) |

Creating parallel relations, i.e., XOR, OR, and AND (Table 6) | \(O\left( {n^{3} } \right)\) |

Creating parallel relations, i.e., XOR, OR, and AND (Table 7) | \(O\left( {n^{3} } \right)\) |

Total complexity | \(O(n^{3} )\) |