d processor.
>
> On Jun 1, 9:32 pm, "akshay ranjan" <[EMAIL PROTECTED]> wrote:
> > can someone please guide me about how to proceed ??
> > which API's are reqd and how to implement them??
>
>
> >
>
--~--~-~--~~~-
can someone please guide me about how to proceed ??
which API's are reqd and how to implement them??
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge
or each
> insertion.
>
>
>
>
> On 8/15/06, akshay ranjan <[EMAIL PROTECTED]> wrote:
> >
> > the link is not being sorted the elemnts are being read frm the array
> > and inserted at the end of the list ( not sorting ). while traversing
> > to end of th
or random numbers scenario) to sort the array -
> O(n log n) - and then traverse through the array to find the repeated
> element - O(n).
> The creation of link list is nothing but insertion sort, which is O(n^2).
>
> ~Vishal
>
>
> On 8/15/06, akshay ranjan <[EMAIL PROTE
Not sure About the soln. but here goes
Create a link list
The node contains the number along with the list pointer. while
creating the list impose a condition on insertion to chk for
repetion.. i.e while traversing the list chk if the element is already
inserted or not .given that n-1 are uniqu
no compile time checking for the array bounds is provided .
On 5/26/06, Sriram narasimhan <[EMAIL PROTECTED]> wrote:
hi guys,
i wrote a program for arrays and i declared only a[3]. but my array accepts a[5]=10; statements and other statements...how is that possible..arrays are consid
Try b-trees. they are quite useful representations of large databases On 5/22/06, Dirk <[EMAIL PROTECTED]
> wrote:Hi Varun,thanks for your reply!Sparse matrix memory implementation sounds like a fit to me.
Will give Google a try and find out more about it!Thanks,DirkX-Google-Language: ENGLISH,ASC
slot
On 5/10/06, akshay ranjan <[EMAIL PROTECTED]> wrote:
if you hash each queue no. ( collision resolution thru secondary hashing) then each queue slot would be equidistant
On 5/8/06,
[EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
At this time,I have following 2 options in my mind,1. Wh
Floyd Warshall, Ford or djikistra's algorithms will solve shortest path problems but not find all paths . The soln for this would be recursive( brute force aproach) On 5/9/06,
Alejandro Narancio <[EMAIL PROTECTED]> wrote:
You can use the Floyd algorithm.Regards,Alejandro
On 5/9/06, Dhyanesh <[EMAI
try insertion sort as algo A and merge sort as algo BOn 5/8/06, someusername <[EMAIL PROTECTED]
> wrote:Hi all. I have this problem with analysis of algorithms, I thought
maybe I could get some help here... It's not defined *that* strictly,so I guess I shouldn't be looking for an exact solution. Th
if you hash each queue no. ( collision resolution thru secondary hashing) then each queue slot would be equidistantOn 5/8/06,
[EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
At this time,I have following 2 options in my mind,1. When a request for a queue with a requirement of m slots, given thecalend
I think that this tree would always be balanced till one level from the leaves. so employing bfs wouldn't be optimum. you can check if the tree is full or not at the last level . if it is not full insert at that point , in case if the tree is full you need to insert in the leftmost node in the next
Are the queues being implemented on first come first serve basis or is thre some priority list??On 5/7/06, adak <
[EMAIL PROTECTED]> wrote: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 i
isn't this specific for array implementation of stack onlyits written in the original ques that no assumptions about the implementation are to be madeOn 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
14 matches
Mail list logo
