- Category:
- CSharp
- Tags:
-
[C/C++]
[源码]
- File Size:
- 1kb
- Update:
- 2014-03-06
- Downloads:
- 0 Times
- Uploaded by:
- 姜玉洁
Description: The two were in ascending order of an ordered array of a and b copied into the first three ordered array, c. m and n are each a and b is the number of array elements, the result is the number of elements c k. For example, a and b respectively, the array {1,2, 2,3,8} and {3,4,7,8}, the resulting values of the array c is: {1,2,2,3,3,4 , 7,8,8). Algorithm is: a, b two elements of two arrays as two queues, comparing the first team will put the smaller end of the queue c, if the team' s first two elements are equal, first select a queue header element Join c queue tail. Loop executes the above process until a or b, one queue is empty, and then copy another non-empty queue to c queue tail. Note: Do not allow the use of other algorithms (such as sorting algorithms). Try to create a class Com, completion of the merger work.
To Search:
File list (Check if you may need any files):
homework\2.cpp
homework
Download