Search:

After you said that a lightblub went off in my head! THANKS!! :D

I've narrowed it down to here... What is wrong with this??


for(p = *front; p != NULL; p = p->next_proc_ptr){}


thanks for your help.

yup. but it shouldn't matter if I use ReadyList[1] instead of ReadyList[0].. ? or should it. I was just using main to test out my queue which has a seg faults in it :(

No that is correct. Since I initialized my Array with 6:


proc_ptr ReadyList[6];

my for loop will only run 6 times:


for(i = 0; i < 6; i++)

I'm having a hard time finding my segmentation faults. Can anyone help me out please?


#include <stdlib.h>
#include <strings.h>
#include <stdio.h>

typedef struct proc_struct proc_struct;
...

Thanks for the help. This assignment is due tomarrow and the execution time is worth 40% of the assignment. I think I'll be getting a 60% on this assignment because I don't think I can code a hash...

If I put the contents of the dictionary into a BST, how would I make it so the BST would be balanced? Since the dictionary is already in order, I would have a BST that would look like a linked list....

My questions is how can I make this program more efficient. I have ran out of ideas of what to do. This program takes way too long to execute. I just starting coding in C 3 months ago so I don't know...