inputarray[0] means first element of input array. That's not a set at all. Union means recurrent elements must be ignored in the second and nonrecurrent elements are added to the set.

You must check whether all elements present in B is present in A or not. Union is just not copying two arrays in a single array, you must check for duplicates.

Postfix expression is used to aid the order of evaluation of a mathematical expression.
When higher level programming languages came into existence one of the major hurdles faced by computer...

Loop through and convert the group of characters next to c's,v's,m's ..... into integer datatype, take each character and change ascii value or perhaps use atoi function and multiply by powers of...

Both IE and Firefox.

Even my handwriting was poor (my teacher used to compare it with Gandhi's handwriting) but somewhat legible, among students i was called an intelligent 'kid'

Switching contents is not recommended as it becomes tiresome when the contents of the node are huge.
Check out this one, http://alumnus.caltech.edu/~pje/llmsort.html

Inside a loop use if condition to check the level, and proceed as long as the list exhausts.
for eg.

/*Inside a loop */
if(node->level==1)
list1->next=node

The loop terminates when...

post the code in the appropriate forum. This is a Community introduction site.

I'll vote for computer engineering.

Brilliant, but not quite enough
User: Do you know about me?

Cleverbot: Why would I want to?

User: Because I'm chatting with you. Will you chat with strangers?

Cleverbot: And i'm doing the...

campfire means your thread is running hot, with a huge number of views.

He didn't want his nose to be in the same shape as his father's.

Use file concepts if it is not the translation you are looking for. http://www.codersource.net/cpp_file_io.html

Ok, Ok, Everyone screwed me. But, I felt that printf would be easier to format.

yeah, think so.

"cout" doesn't support any specific formatting. You can use printf defined under stdio. Use a corresponding qualifier.

what was the best moment of your life so far??
common start sharing ur memories here!!! :)

I never said this is functional. Just to give him an idea to start.

I have always admired the ability to bite off more than one can chew and then chew it.

Nothing splendid has ever been achieved except by those who dared believe that something inside them was superior to circumstances.

What else do you want? It is fairly good. But what you'll get includes the root. So subtract by 1, you'll get the size of the subtree.

Divide the numbers continuously by 2 until you get 0 as the quotient. The net remainder you get is a binary number.

To start with this routine must do, build on it.
function
{
sum+=function(string[i+1])*pow(base,i);
return sum;
}

This is not a functional code, work on it. See the pattern and try it...

Could you be a bit more specific :).

Not necessarily.

This should help.

for(i=0;string[i]!='\0';)
{
for(j=0;j<3;j++,i++)
{
tempstring[i]=string[j] /*this seperates into 3s, tweak this and you'll get necessary output each time tempstring is...

Here you have not created any structure variables, a structure variable is created as follows, struct moviedata variablename. If you more structure members, include them in the structure definition....

It is the users who write the code and they sometimes may be wrong.

Hey you want people to send you the entire code?? You must know your talents, your abilities and do accordingly :).

Yeah, obviously they can recognise only two states on or off. But it may undergo radical changes in future. Read about quantum computers. :)

what is this???
for(int i = 0; i , index; i++)
{
total += dataItem;
}

Why that ','

Your 3rd line is wrong. It must be fp=fopen("/usr/lib/htmlexamples/default.html", "r");
because fp is the pointer to the string not fopen, you somewhat muddled it. Or otherwise you can have it...

I said that because he defined marks beforehand and didn't take it as input.

You are recursively traversing the tree right. In each stage you must push the element into a particular queue based on its level. So if the depth of the tree is 3, you'll have 3 queues.
...

I'm not sure, but maybe it is a convention that global variables are allocated memories in the first few slots.

Well, post your code first.

don't need to complicate things, simple logic will be fine, take a string convert it into numbers....................

Move through converting each blocks character sets into integers.

take it as string, and define another integer variable and store it over there appropriately.