- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
11 Posted Topics
 | If it was in Windows you would use FindFirst thing to read all files in folder, then you use like list to save all those times and find the dessired one, but if I remember well you need some. For Linux world you need to add some dirent, sheck this … |
| | Re: pibonacci series And when it comes to Fibonachi array, do you like recursion or not, would you accept aprosimation, or is it just like same old plain...  |
| | Re: Pi Approximation There are manny aproximations for pi, try to find the fastest one to human kind. Look for the best algorithm, and then try to ask the expert in numerical math...  |
| | Well try to make coments and that would be pseudo code. But if it is for school I don't know how your techer like it, or what he would like to consider as the pseudo code. Is there faster way to count that, I would like to hear it form … |
 | |
 | Re: findfirstfile Oh I would like to see that thing done with > try except thing like, because the MSDN program still uses errror.h, and hendels the error in old fasion way! |
| | Well I have created this one and on my computer it is working. I would like to hear about some alternative solutions. INTRODUCTION This time I have one algorithm, but to understand it we need to consider a few terms. First of all, we should be familiar with the pangrams. … |
| | If I understand your question you would like to solve the equation with two uknown, like x and y forexample. One of my favorite ways to solve that thing if you don't need to worry about the error is determinants. But if you wanna solve this thing for real, consider … |
| | Well there are manny places you could use arrays in this one, but you could use vectors also. Don't hus about terminology. Try to have one array that will be bool type, so now you have the abilyti to see wich one you have picked already. Now you wait till … |
| | Well, small thougt form number theory. Every prime number greater than 3 is of 6n+1 or 6n-1 form, the oposite way thos not fly. The improvement is try to divide number by 6 and if you have like 5 or 1 remaning you have potential prime number. I have not … |
 | First of all try to use vector and to add the new members at the end of vector.  |
The End.