I agree with Googmeister since in arrays the size of arrays are fixed
we can't play wiht htem as easily as we can do with linked list. That's
why we need to copy elements to another place when Merge sort is
applied to arrays. But in linked list simle linking and de-linking
saves that extra space
hi arul,
i think you can write a program in c without main().The main fn is used to start the program so if you could direct the compiler how to proceed about then you can definitely write the program.
sriram
On 5/14/06, Arulanandan P [EMAIL PROTECTED] wrote:
hi , Can any one let me , is it
Phuff wrote:
By the way it formatted by box horribly. It looked good on preview.
sorry.
Start with the point with the least y coordinate (and the leftmost
point in case of a tie). Then find the polar angle between this point
and each of the rest of the points, and sort the points. This will
I do know of the master method. In fact, I ran into this problem while
doing exercises in that method. The problem is that this is one of the
borderline cases that do not fall into the master method. i.e. O (n ^
(log a to base b)) is not polynomially larger or smaller than f(n)
which is n^2 lg n
