Yanoh sample quiz2#1
Open
yanoh wants to merge 4 commits into
Open
Conversation
Member
Author
There was a problem hiding this comment.
お題のデータとして 0..299 をランダムに並べ替えたものを設定してます。
… precondition check in order not to die when an empty list is passed to min/max/minmax function
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
近藤さんから聞いたクイズ(その2)を解いてみました。
お題
任意の数値列から、
を効率よく抽出せよ。
アプローチ
1 と 2 に関しては、どちらも愚直に全要素を比較してます。
3 は、リストの先頭から 2 要素ごとに比較し、その結果から最大値 / 最小値を更新することで、比較を 2n 回から 3n / 2 + 1 回に抑えています。
3 の具体例