Posts by DJSAN10

Well I would suggest you to try http://opencv.org/
I guess willowgarage is an older link. And from what you have written ,seems that its an installation problem

My question is how do I erase and edit the text file when I edit information? (eg, what where and what type of search?)I plan to write to the text file before exit and read it when the program start.

This technique might be bad efficiency wise , but the most simplest way i can think of is read the entire file as a string, use replace function of String class to edit/erase your file contents and write back to your file i.e. overwrite it.

Okay in your constructor for bank, there is a line

accounts = new Account[numAct];

and then you are doing

ccounts.setNumAct(numAct);

Thus when in your constructor , numAct is nothing but 0

int LinearSearchArray ( const int list[], int numEless, int value)

{ //<<--------this is where I get my error
int index=0;
int position= -1;
bool found = false;

while(index < numEless &&!found)
{
found = true;
position = index;
}

index ++
}
return position
}

There is no semicolon after last two lines
index++ and return position

.if the above condition is false i dont want my code to go further and calculate the input.How and i able to do this.Presently everytime i enter an invalid number ,it still processes the output but also come up with the statement"invalid number".

If you want to straight away exit your program you will have to use exit() inside if statement. If you are in a loop and simply want to get out of the loop then you will have to use break as mentioned by adil bashir

if(a < 1 || b < 1 || c < 1 || d || 1)
{
System.out.print("Invalid Input");
break;
}

You need to decide whether you want to use '&&' or '||' depending on what condition you wan to check. If you are looking for any one of a,b,c,d to be < 1 then above code using or condition is fine . If your condition is true when all a,b,c,d < 1 , then you will have to use and (&&) instead

You will get a pretty decent idea from this post
http://www.daniweb.com/software-development/computer-science/threads/19933

Everything that can be counted does not necessarily count; everything that counts cannot necessarily be counted.
Albert Einstein

I don't know how many of you all know about this already. But I found this pretty interesting. Check it out :
http://www.gnu.org/fun/jokes/unix-hoax.html

Enjoy..:P :-O :D

Method1
(The XOR trick) a ^= b ^= a ^= b;
Although the code above works fine for most of the cases, it tries to modify variable 'a' two times between sequence points, so the behavior is undefined. What this means is it wont work in all the cases. This will also not work for floating-point values. Also, think of a scenario where you have written your code like this

swap(int *a, int *b)
{
*a ^= *b ^= *a ^= *b;
}
Now, if suppose, by mistake, your code passes the pointer to the same variable to this function. Guess what happens? Since Xor'ing an element with itself sets the variable to zero, this routine will end up setting the variable to zero (ideally it should have swapped the variable with itself). This scenario is quite possible in sorting algorithms which sometimes try to swap a variable with itself (maybe due to some small, but not so fatal coding error). One solution to this problem is to check if the numbers to be swapped are already equal to each other. swap(int *a, int *b) {
if(*a!=*b) { *a ^= *b ^= *a ^= *b; } }

Method2 This method is also quite popular a=a+b; b=a-b; a=a-b; But, note that here also, if a and b are big and their addition is bigger than the size of an int, even this might end up giving you wrong results. Method3 One can …