Skip to main content

[SOLVED] Heap Sort and Quick Select Algorithm using array to find the k the maximum

Image
By

  • Creates an array of random integers of size 1,000,000.
  • Develop the first algorithm to find the Kth largest number from the array (1 <= K <= 1,000,000).
  • The algorithm must be based upon using a heap of size of K. Measure and average the running times of your program. having a base-case such as if (start == end) return A[]; center = (start+ end / 2) use either minHeap or maxHeap for finding the Kth largest number use divide to cut the array and conqueror for example: {2,3,4,8} = quickslecet )A[], start, center) {1,4,6,7} = quickslecet (A[], center+1, end) use conqueror for the for loop for example int i= start, j=center, i<= center && J<=end)
  • Develop the second algorithm to find the Kth largest number. You need to follow the quickselect algorithm to implement the solution. Measure and average the running times of your program. Deliverables: Source code. Performance analysis document that will record, compare, and analyze the running times of the two solutions.

Get your solution now

Buy now
Labels:

Comments

Post a Comment

Popular posts from this blog

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

By
21 comments
Read more

The Zoo Management System - entity relationship diagram & MS Access Database

By
Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...
1 comment
Read more

Body Mass Index (BMI) calculator with JUnitTesting in Java

By
Introduction: Aitor Tilla S.L. clinic specializes on the endocrine treatment of people with diverse needs in relation to weight control. The clinic wants to launch a number of technological solutions (mobile app and web pages) that will allow its clients to have an effective monitoring of the dietary plans suggested by the clinic doctors. To this end, Aitor Tilla, S.L. requires to evolve the component that measures metrics for a healthy life developed during the previous guided exercises. The component will be reusable and will allow the calculation of new necessary metrics. The component will be developed in Java, J2EE platform, and will be delivered in a JAR format that will allow the access to the methods, and the programming interface that integrates with the mobile app and web pages. In addition, the code will be delivered with a user manual that explains programmers how the integration with other components should be done. The function to consider consists of characterizing the B...
Post a Comment
Read more