[CareerCup][Google Interview] 找出最小排序次数 - chkkch - 博客园
Given an unsorted array provide two indices n1 and n2 such that if we only sort the elements between n1 and n2,then the whole array will become sorted.
n1-n2 should be as minimum as possible.
http://www.careercup.com/question?id=4345015
Read full article from [CareerCup][Google Interview] 找出最小排序次数 - chkkch - 博客园
No comments:
Post a Comment