MIPS question.....................help

[Nandaiyo]

How do you implement the function MERGE in MIPS?

struct node{
int value;
node *next;
}

p1 and p2 are pointers to SORTED LINKED LIST.

The function:

node *merge(node *p1, node *p2)

Sort two of the sorted list and store it in one linked list and return the pointer to it.


p/s:assume that you can call void *new(# of bytes) that will allowcate a memory for it.


write the merge in MIPS.

help me please.

 

[MC]

hmm...sounds complicated

 

[TomC25]

ITS MOOPS!

sorry, can't help you

just had to say that since this is in off topic

 

[bUnMaNGo]

hmm I think allocating some .space one after the other would work... but I don't know how exactly one would create a linked list in MIPS... I'm assuming it would be the same as a stack, except using different pointers? (we're talking about MAL here, right? MIPS Assembly Language?) Then just use the frame pointer of the first linked list, and the stack pointer of the second linked list as the frame pointer and stack pointer of the merged linked list. Also you gotta deal with whether they're .byte's or .word's, which would affect your offset. I dunno how to sort the list though. Hope this helps a little.

 

[bhuie]

If you have access to a UNIX shell account on a MIPS machine, you could just write it in C and set the compiler option to spit out the assembly.

 

[ManSnake]

Sorry, I only know SPIM, I don't know MIPS

 

[piku]

<< Sorry, I only know SPIM, I don't know MIPS >>



Is that a joke?

 

[ManSnake]

Is that a joke?

Well, sorta, SPIM is a MIPS simulator written for UNIX, so...