## Binary Search Quiz

Question 1 |

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

O(n^2) | |

O(log(n)) | |

O(n) | |

O(n!) | |

O(1) |

There is 1 question to complete.

Question 1 |

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

O(n^2) | |

O(log(n)) | |

O(n) | |

O(n!) | |

O(1) |

There is 1 question to complete.