hi harsh,
u r using merge(), which is implementaion specific!!Cheers,
siva.
On 5/5/06, harsh [EMAIL PROTECTED] wrote:
This is clearly O(N*N)I will give you an O(N*log(N)) algorithm..Stack sort(Stack S, int N){// N is the number of elements in thestackStack s1 = new Stack();for (int i=0;iN/2;i++){
hi,
I am new to this group, I am looking for an algorithm
for allocating time-slots in a scheduling table.
Scheduling table has a depth of n ( max value 2048 )
time slots and it can be used to schedule m ( max
value 512 ) queues.
A queue can have at most 12 time slots in the calendar
table. Main
Hi anish
i m sriram...i m also new to this group doing my firstyear engineering.i m interested in learning more on computerspls help me to learn more and pls teach me the logics and other stuffs which are necessary for me...introduce me to your friends also...
thankyou
Sriram.N
On 5/6/06,
Welcome to you both. Sriram, it's VERY discourteous to post an
unrelated reply to Anish's post, just above.
Either don't do that, or expect to be flamed and/or ignored in the
group.
Anish, I have heard of an algorithm expressly for this, but I'm sure
there are one's around. What have you
