Description: Specifically, if an array A [1 .. n] more than half of the elements are the same, the array is known as a main element contains. (A) to design an effective algorithm (at least O (n logn)), to determine whether the array contains a primary element, and if so, find out the elements. (For simplicity, assume that n is a power of 2, and n < 150) (b) can give a linear time algorithm? It must be noted that the array may not exist between the elements of the order- that can not be " A [i] <A[j]”的判断，但是可以进行是否相等的判断。
To Search:
File list (Check if you may need any files):
主元素\Debug\主元素.exe
......\.....\主元素.ilk
......\.....\主元素.pdb
......\主元素\Debug\BuildLog.htm
......\......\.....\mt.dep
......\......\.....\vc90.idb
......\......\.....\vc90.pdb
......\......\.....\主元素.exe.embed.manifest
......\......\.....\主元素.exe.embed.manifest.res
......\......\.....\主元素.exe.intermediate.manifest
......\......\.....\主元素.obj
......\......\main1.txt
......\......\main2.txt
......\......\result.txt
......\......\主元素.cpp
......\......\主元素.vcproj
......\......\主元素.vcproj.LovelyJin-PC.Lovely Jin.user
......\主元素.ncb
......\主元素.sln
......\主元素.suo
......\主元素的实验报告.doc
......\......\Debug
......\Debug
......\主元素
主元素
Download