Thread: Linked Lists please help!!!

Can anyone tell me how i can make a function that takes an Array and sorts it with the heap sort?

Originally Posted by ValL

Ok my friend i did what you told me as first step for the exercise... And it seems to wok fine but let me sent you the part i did to check it maybe i have done something wrong!!

That's not really what I've had in mind.

With your version you can only write the array to the file the first time. For the second time (writing out the heap sorted array) you would still need a second function.

I would write the function in a way that you can use it for both writing operations. The main program would then look like

Code:

create_array(array, n);

first_file = fopen(...);
write_array(first_file, array, n);

sort_array(array, n);

second_file = fopen(...);
write_array(second_file, array, n);

In general a function should do one particular thing.
Your function is calculating random numbers, assigns them to the array (and assumes that the first element is already written to the file), writes them to the file and prints them to the screen. Thus you can't use it in another part of your program because it is too specific.

Bye, Andreas

Nice help!!! Thank you

That's wonderful. Now can we finally let this thread die? Thanks.

Can you just say anything (small help) about what i have asked and do not tell me every time i ask something, to give you evidence for my attempts i have done? Is that difficult to you? Or maybe you can't just get over it that here i am not to copy anything and just paste it in my exercise so i will be done? Is just a simple thing. Say a few words of what i have asked and don't delve into everything i said to find a problem. There is not any problem my friend!! Thank you.

P.S : And yes you can finally let this thread die...

You still do not understand me... I do not want code neither from you or Google. I just want a small help, like we say mmm, the priority queue does that (and don't explain it like an encyclopedia), and you should make a function which checks that...(only 2 lines of explaining, not much). Is not that difficult. Not code and not much words.

Thank you again!!!

Originally Posted by http://en.wikipedia.org/wiki/Priority_queue

... a priority queue ... is like a regular queue ... data structure, but where ... each element has a "priority" associated with it.

In a priority queue, an element with high priority is served before an element with low priority.

If two elements have the same priority, they are served according to their order in the queue.

... elements are pulled in first-in first-out-order (e.g. a line in a cafeteria)

A priority queue must at least support the following operations:

- add an element to the queue with an associated priority
- remove the element from the queue that has the highest priority, and return it

Is that enough for you to go on? Try to understand and implement as best you can. If/when you get stuck or have further questions, create a new thread and clearly describe the problems you're getting or questions you have.

Hopefully, this thread will be closed to prevent further ignoring the moderators advice to start a new thread.