yes, you have to do some thing like that only. It your wish to use the recursive function or not but I don't recommend to use the recursive function in this case and earlier one too.

In any number...

There come 3 condition while deleting..
1. node is at the front
2. node is at last
3. node is in between

You need to have the previous node of the list in order to join again...

You can...

Nice thought to use the recursive function...

recursive function should have the terminating point which in the conversion always turn to 1 at last.


void binary(int num)
{
if(num!=1)
...

check line no. 73. & 74.

Let me put in right way..
you are creating the renewing list each time you add new nodes (new songs).
in every insertion ... your list pointer is set in to NULL. causing the earlier information to...

I agree with you ArkM. :)
I wan't to ask what container have to be used to do such thing...

And don't tell me sets.. stuff like my mathematics teacher does..:D

I guess its not the healthy choice according to him as he says many no...
I'm doubting about the the question.:-/

According to the sorting algorithm I have already told you its the Selection sorting.
But i don't think so you can possibly create the batch of no without using array or pointer.

Other crazy...

Its the simple question ... When we use to learn the C++
This type of Sorting is known as Selection sorting...

Rest you figure it out...:D