[algogeeks] Re: Inplace sorting

On Mar 14, 5:43 pm, Rajiv Mathews [EMAIL PROTECTED] wrote: On 3/14/07, NUPUL [EMAIL PROTECTED] wrote: Firstly your problem is not out of the blue...it's an enquiry for an existence of such an algorithm. Secondly, a good deal of research has gone into finding algorithms with O(n

[algogeeks] Re: Inplace sorting

: Cormen. It'll satiate your appetite for the hunt of such an algorithm. If you are successful at finding such an algorithm do post it here! Regards, Nupul --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm

[algogeeks] Re: Inplace sorting

sort works in O(nlogn) time. However there are sorts like counting sort, radix sort that work in O(n) time because they are NOT comparison sorts! you can find them in the same book as above. You may look at Introduction to algorithms: Cormen or a book by Horowitz/ sahni. Regards, Nupul

[algogeeks] Re: dynamic memory allocation in C

the code is doing Cheers, Peri. Peri, your questions are very specific to C. Please try the group comp.lang.c Regards, Nupul --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

[algogeeks] Re: Binary Tree Depth()

to implement an algorithm using one stack or one quene,like traversal methods do?) Which other traversal methods are you talking about? The 'graph' traversal methods are usually specified recursively as they are easier to read/understand that way. Regards, Nupul

[algogeeks] Re: Generalized Shortest Path Problem

the algorithm from data structures by tanenbaum, where the algorithm is taking only the edge costs into account. Try this book Introduction to algorithms: Cormen you can tweak the algorithm given there to suit your needs. Regards, Nupul --~--~-~--~~~---~--~~ You

[algogeeks] Re: The Game

in almost all good books on algorithms. Regards, Nupul. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from

[algogeeks] Re: need help

effective solutions employ Backtracking and are correctly suggested so by the other group members. Google around for this problem (fondly known as 8-queens problem) and you'll get very helpful (but not exact) solutions to your problem. Regards, Nupul

[algogeeks] Re: About implementing RegEx pattern-match using finite automata

Nupul --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more

[algogeeks] Re: new to algorithms

try the standard data structures in C/C++ by aaron tanenbaum (and 2 more authors, whose names are not-so-easy-to-recollect. :P Well could you be more specific when you say maths of the alogrithms? thanks nupul --~--~-~--~~~---~--~~ You received this message

[algogeeks] Re: project for cs

Pls be more clear... 1. Do you want them to get the feel of HOW the computer operates via a command line interface? or 2. Do you want them to know how does language to machine code transition takes place? Nupul --~--~-~--~~~---~--~~ You received this message

[algogeeks] Re: Linking sibling in a binary tree

I was wondering if there is any method to link all sibling nodes in a binary tree i suggest you read up something on B trees and B+ trees and then put forth this question. Nupul --~--~-~--~~~---~--~~ You received this message because you are subscribed