2.3 Main elements of the problem (books 2-9) Description of the problem: Let T [0: n-1] is the n-element array, if one of these elements in the array x number of occurrences of more than n/2, called x The main elements of the array T. Input data from a text file named input.txt document. Please design a linear time algorithm to determine whether there is input data from the primary element. In the lab report on an analysis of time complexity. Input: File 1 of act number of elements in the array S in n the next n lines, each line has a natural number. When the run is finished, will result in the output to the file output.txt. Output file contains the answer to the question: Can not find the main element is given null, given the time to find the main element.

2.3主元素\findhostelement.cpp
.........\HostElement.exe
.........\input.txt
.........\output.txt
2.3主元素

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．