Flashcards
Form Chapter 1 Questions
Cards in this deck (1)
- 1Questions from Chapter 1: Q1: Let A[1::n] be an array of integers, where n > 2. Give an O(1) time algorithm to find an element in A that is neither the maximum nor the minimum.Is it Randomize algorithm
Information
- Description
- PhD Algorithms Flashcards on Form Chapter 1 Questions, created by binmakhashen on 24/06/2014.
- Created by
- binmakhashen
- Views
- 21
- Rating