## Bellman-Ford Quiz

Question 1 |

What is the worst case performance, expressed in Big-O notation, of the Bellman-Ford algorithm?

O(|E|+|V|) | |

O(log(n)) | |

O(1) | |

O(|V||E|) | |

O(n^2) |

Question 2 |

What is the average case performance, expressed in Big-O notation, of the Bellman-Ford algorithm?

O(|E|+|V|) | |

O(log(n)) | |

O(1) | |

O(|V||E|) | |

O(n^2) |

Question 3 |

What is the worst case space-complexity, expressed in Big-O notation, of the Bellman-Ford algorithm?

O(1) | |

O(|V|) | |

O(|V||E|) | |

O(|E|+|V|) | |

O(|E|) |

There are 3 questions to complete.

List |