## Depth First Search Quiz

Question 1 |

What is the worst case performance, expressed in Big-O notation, of the Depth First Search algorithm?

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

O(log(n)) | |

O(n) | |

O(|V||E|) | |

O(n^2) |

There is 1 question to complete.

Question 1 |

What is the worst case performance, expressed in Big-O notation, of the Depth First Search algorithm?

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

O(log(n)) | |

O(n) | |

O(|V||E|) | |

O(n^2) |

There is 1 question to complete.