Advertisement
Advertisement
| 11.20.2007 at 02:47PM PST, ID: 22974168 |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: |
MyPriorityQueue extends MyMinHeap + MyPriorityQueue () // creates an empty priority queue + MyPriorityQueue (in arr : Comparable [], in n: int) //creates a priority queue out of an array of Objects + enqueue(in o: Comparable) : boolean //adds a new student to the queue return false if there's no more room + dequeue() : Object // removes the next Object in the queue or null if the queue is empty MyMinHeap - theHeap: Comparable [] - size : int + MyMinHeap () + MyMinHeap (in arr : Comparable [], in n: int) + getSize() : int + add (in o: Comparable) : boolean + removeMin () : Object - shiftDown (in index : int) : void - buildHeap () : void + parseInts() : void // shows the contents of the Heap assuming it holds elements of type Integer + parseStrings(): void // shows the contents of the Heap assuming it holds Strings Obviously, you may add any additional function you might feel is needed. |
