dev-cpp-users — Dev-C++ users discussion list

RE: [Dev-C++] Using Command Line to Execute program

[<Ech...@ne...>]

I assume you mean to compile it, and that the program is in a file called harmonic.c

Since dev-cpp uses gcc as it's compiler, I think you would youise the following command, from the file's directory:

gcc harmonic.c -o harmonic.exe

however, since it is a windows compiler, it might need other options? :-)

---- message follows ----

Please show me step-by-step how to use DevC++ to run a program through 
Command Line method fpr the following program. Thank you!!!!!!!!!!!!!!


#include  <iostream.h>
#include  <stdlib.h>
#include <stdio.h>
               
//----------------------------------------------------------------------------

----
// array passed as pointer

float  sum_array( float *A, int len )
{
   float s = 0;
   for( int i = 0; i < len; ++i )
   s += A[i];
   return s;
}

// array passed as array of unspecified length

float  average_array( float A[], int len )
{
   return  sum_array( A, len )/len;
}

//----------------------------------------------------------------------------

----
void  main( int argc, char **argv )
{
   if( argc != 1 )
   {
       cerr << "Usage: " << argv[0] << " number" << endl;
       cerr <<"int argc: "<<argc;
       getchar();
       exit(0);
   }

   int  n = atoi( argv[1] );
   
   float  H[n];
   
   for( int i = 1; i <= n; ++i )
   H[i-1] = 1/float(i);
   
   cout << "harmonic number " << n << ":   " << sum_array( H, n ) << endl;
   cout << "average 1/i up to " << n << ": " << average_array( H, n ) << 
endl;
   
   exit(0);
}

//--------------------------------
------------------------------------------------





-- 




__________________________________________________________________
Your favorite stores, helpful shopping tools and great gift ideas. Experience the convenience of buying online with Shop@Netscape! http://shopnow.netscape.com/

Get your own FREE, personal Netscape Mail account today at http://webmail.netscape.com/

[Dev-C++] Print numbers up to n digits wide of number system base m.

[Dario P. <do...@ho...>]

/*
Let m be an integer, greater than zero but less than eleven. Numerical 
strings, in which each digit is greater or equal to 0 but less than m, are 
numbers of the number system in the base m. The numbers 10110 and 1981, for 
example, are numbers of the number system in the base the 10, but only the 
first one is a number of the number system in the base 2. The zeros at the 
beginning of the number are leading zeros, unless the number is 0.

Write a program that reads the integers m and n, and outputs all numbers of 
the number system in the base m containing n digits at the most, and without 
leading zeros. Each number may be output only once.

You may assume that m is greater than 0, but less than 11, and that n is 
greater than 0 but less than 81.

The numbers should be output on consecutive lines, one number per line
*/

I've been banging my head over this problem since last week, and i'm no 
closer to an answer than i was when i started.

I find myself always coming back to the idea of implementing a bidimensional 
array as such: nsys[n][m]

But i can't figure out the system of loops and conditions that would 
correctly solve this problem.

I'm hopelessly stuck. I'll keep banging my head, but i doubt i'll answer 
this.

I thought i'd ask for some help. Some clever hints would be better than the 
straight answer, as i would like to figure out as much of it by myself as i 
can. But i really need help.

Thanks...

adios,
biterman.

<<That government is best which governs the least... that government is best 
which governs not at all.>>


_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp

[Dev-C++] Using Command Line to Execute program

[<Cuo...@ao...>]

Please show me step-by-step how to use DevC++ to run a program through 
Command Line method fpr the following program. Thank you!!!!!!!!!!!!!!


#include  <iostream.h>
#include  <stdlib.h>
#include <stdio.h>
                
//----------------------------------------------------------------------------

----
// array passed as pointer

float  sum_array( float *A, int len )
{
    float s = 0;
    for( int i = 0; i < len; ++i )
    s += A[i];
    return s;
}

// array passed as array of unspecified length

float  average_array( float A[], int len )
{
    return  sum_array( A, len )/len;
}

//----------------------------------------------------------------------------

----
void  main( int argc, char **argv )
{
    if( argc != 1 )
    {
        cerr << "Usage: " << argv[0] << " number" << endl;
        cerr <<"int argc: "<<argc;
        getchar();
        exit(0);
    }

    int  n = atoi( argv[1] );
    
    float  H[n];
    
    for( int i = 1; i <= n; ++i )
    H[i-1] = 1/float(i);
    
    cout << "harmonic number " << n << ":   " << sum_array( H, n ) << endl;
    cout << "average 1/i up to " << n << ": " << average_array( H, n ) << 
endl;
    
    exit(0);
}

//--------------------------------
------------------------------------------------

[Dev-C++] How do I make graphical windows applications using dev-cpp?

[Brian M. <str...@ho...>]

How do I make graphical windows applications using dev-cpp?

_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp

Re: [Dev-C++] Efficiency

[St0fF 6. <st...@gm...>]

Hi all!
Yes, yes, and again yes!
We all are right.  I learned recursion by using factorials, but our computer
science teacher was pretty much as I am.  He showed us the extra-time
recursion needs for 'stacking', and as an exercise he wanted us to implement
such recursive functions iteratively. That's why my Idea was as it was.
And yes: one of the first recursions in my life was the fibo-seq. Another
one was Sierpinski, whích is more of a problem to implement iteratively ...
At this point I would like to hear from Mansoor,
because we really showed off some knowledge and don't know if it helped ...
Greets!
St0fF.

Re: [Dev-C++] anyone help me

[St0fF 6. <st...@gm...>]

Hi, I think the pupose of devcpp is not to do it like microshit does. also
it uses a different compiler, so you'd have to convert the libraries (*.lib)
to mingw-format (*.a).
Why don't you use VC if you need MFC's?
St0fF.
----- Original Message -----
From: "kazim siddiqui" <kaz...@ho...>
To: <dev...@li...>
Sent: Sunday, November 11, 2001 7:21 PM
Subject: [Dev-C++] anyone help me


> how can I use MFC (microsoft foundation classes) in Dev-C++....is afxwin.h
> builtin in Dev-C++....do I have to set some parameters for it.....I m
using
> Dev-C++ version 4.
> regards,
> khawar
>
> _________________________________________________________________
> Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp
>
>
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users

[Dev-C++] RE: Problem with OpenGL

[Julio L. <ju2...@ya...>]

create a dev-c++ project and add the source code file
to the project. In the project options add -lglu32
-lglaux -lopengl32 (or -lopengl, forgot which one) and
then recompile project....

_______________________________________________
Message: 4Date: Tue, 13 Nov 2001 15:11:23 +0100
Organization: http://freemail.web.de/From: "Max
Palitza" <Max...@we...>
To: dev...@li...:
[Dev-C++] Problem with OpenGL
Hi everybody!
I've got a  problem with compiling OpenGL code written
in C. When I 
want to compile this code#include <windows.h>						
#include <gl\gl.h>						
#include <gl\glu.h>							#include <gl\glaux.h>int
main(int argc, char** argv){
    auxInitDisplayMode (AUX_SINGLE | AUX_RGBA);
    auxInitPosition (0, 0, 500, 500);    auxInitWindow
(argv[0]);
    glClearColor (0.0, 0.0, 0.0, 0.0);   
glClear(GL_COLOR_BUFFER_BIT);
    glColor3f(1.0, 1.0, 1.0);   
glMatrixMode(GL_PROJECTION);
    glLoadIdentity();    glOrtho(-1.0, 1.0, -1.0, 1.0,
-1.0, 1.0);
    glBegin(GL_POLYGON);          glVertex2f(-0.5,
-0.5);
          glVertex2f(-0.5, 0.5);         
glVertex2f(0.5, 0.5);
          glVertex2f(0.5, -0.5);    glEnd();   
glFlush();    return 0;}
it reports that <i>all</i> funcs used are unknown! I
am quite sure that 
there's a problem with the .h files cause in VC++ I
got it compiling. 
Could someone please tell me what to do in order to
get this problem solved?
Thanks,Max___

=====
Julio

__________________________________________________
Do You Yahoo!?
Find the one for you at Yahoo! Personals
http://personals.yahoo.com

RE: [Dev-C++] Efficiency

[Ioannis V. <no...@ya...>]

If it was for academic purposes to learn recursion, i agree with you
too. :)



Ioannis

* Ioannis Vranos
* Programming pages: http://www.noicys.f2s.com
* Alternative URL: http://run.to/noicys


> -----Original Message-----
> From: Williams, Timothy W. [mailto:TIM...@sa...] 
> Sent: Tuesday, November 13, 2001 10:24 PM
> To: 'Ioannis Vranos'; Dev-C++
> Subject: RE: [Dev-C++] Efficiency
> 
> 
> Good grief! I concur too.  Let me explain my point a bit 
> clearer here: o I assumed he was constrained to solving the 
> problem recursively. o I made that assumption because a 
> frequently used method of teaching recursion includes using a 
> simple problemset, ie. fibonacci. o This is mainly because 
> once situations are complex enough to need recursion, if a 
> person doesn't already know it then they are stuck, for 
> instance learning how to implement a B+Tree and traversing it 
> is a good time to *already* know recursion.  
> o If all he wanted was a fast way to compute the fib 
> sequence, he probably should have asked "how can I make this 
> funcion more efficient" rather than "how can I make this 
> recursive function more efficient"  then I would have been 
> less likely to make assumptions about his constraints. 
> o He could clear it up by letting us know what his 
> constraints were or were not.
> 
> I'm not arguing for a recursive solution in this case if he's 
> doing it for any *real* purpose, although I must say I didn't 
> see any significant performance difference for any relatively 
> small n.  Just out of curiousity how did you initially learn 
> recursion?  I'm guessing it wasn't implementing a tree 
> structure for the first time, right?  Probably the fib 
> sequence, I think it's most ever intro to CS book out there. 

RE: [Dev-C++] Efficiency

[Williams, T. W. <TIM...@sa...>]

Good grief! I concur too.  Let me explain my point a bit clearer here:
o I assumed he was constrained to solving the problem recursively.
o I made that assumption because a frequently used method of teaching
recursion includes using a simple problemset, ie. fibonacci.
o This is mainly because once situations are complex enough to need
recursion, if a person doesn't already know it then they are stuck, for
instance learning how to implement a B+Tree and traversing it is a good time
to *already* know recursion.  
o If all he wanted was a fast way to compute the fib sequence, he probably
should have asked "how can I make this funcion more efficient" rather than
"how can I make this recursive function more efficient"  then I would have
been less likely to make assumptions about his constraints. 
o He could clear it up by letting us know what his constraints were or were
not.

I'm not arguing for a recursive solution in this case if he's doing it for
any *real* purpose, although I must say I didn't see any significant
performance difference for any relatively small n.  Just out of curiousity
how did you initially learn recursion?  I'm guessing it wasn't implementing
a tree structure for the first time, right?  Probably the fib sequence, I
think it's most ever intro to CS book out there. 

--tim


> -----Original Message-----
> From: Ioannis Vranos [mailto:no...@ya...]
> Sent: Tuesday, November 13, 2001 2:52 PM
> To: Dev-C++
> Subject: RE: [Dev-C++] Efficiency
> 
> 
> I astrongly agree with St0fF here. Recursion has time cost due to
> continuous function calls and space cost because of the storage of the
> function calls in the stack (or in the automatic storage if 
> you prefer).
> This applies to fibonacci too.
> 
> 
> Ioannis
> 
> * Ioannis Vranos
> * Programming pages: http://www.noicys.f2s.com
> * Alternative URL: http://run.to/noicys
> 
> 
> > -----Original Message-----
> > From: dev...@li... 
> > [mailto:dev...@li...] On Behalf 
> > Of St0fF 64
> > Sent: Tuesday, November 13, 2001 5:48 PM
> > To: DevCPP; Williams, Timothy W.
> > Subject: Re: [Dev-C++] Efficiency
> > 
> > 
> > Hi!
> > As I said, iteration speeds it all up because no unneccessary 
> > Stacking,
> > meaning: push return address, recursive recall, push return 
> > address, recursive recall, ... , recursive recall, return 
> > solution, pop return address, return solution, ... , pop 
> > return address, return solution, finished. This is the 
> > negative effect of recursion.  In the iterative version we do 
> > counting instead of accessing the stack.  The dealing with 
> > return addresses and the stack is not used in iteration.  
> > Thats why it is faster. St0fF.
> 
> 
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> 

Re: [Dev-C++] Different paths in windows?

[Jason H. <jas...@bt...>]

In the win32 reference I have found an api call - GetVersionEx() that =
should return the information you need, however I don't know what value =
will be returned for Windows XP. It something for you to look into =
anyway.

Jason.
  ----- Original Message -----=20
  From: Stein Nyg=E5rd=20
  To: DevCpp=20
  Sent: Tuesday, November 13, 2001 7:35 PM
  Subject: [Dev-C++] Different paths in windows?


  Hi all!

  I've just finished my latest screensaver-project... Now I have begun =
coding on some installer-prog, but I have a problem. How will I know =
where to install the *.scr file? In Windows 98 it should be in =
C:/windows but in XP it should be in C:/windows/system32... how do i =
check stuff like this?

  Thanks!
  stein

RE: [Dev-C++] Efficiency

[Ioannis V. <no...@ya...>]

I astrongly agree with St0fF here. Recursion has time cost due to
continuous function calls and space cost because of the storage of the
function calls in the stack (or in the automatic storage if you prefer).
This applies to fibonacci too.


Ioannis

* Ioannis Vranos
* Programming pages: http://www.noicys.f2s.com
* Alternative URL: http://run.to/noicys


> -----Original Message-----
> From: dev...@li...=20
> [mailto:dev...@li...] On Behalf=20
> Of St0fF 64
> Sent: Tuesday, November 13, 2001 5:48 PM
> To: DevCPP; Williams, Timothy W.
> Subject: Re: [Dev-C++] Efficiency
>=20
>=20
> Hi!
> As I said, iteration speeds it all up because no unneccessary=20
> Stacking,
> meaning: push return address, recursive recall, push return=20
> address, recursive recall, ... , recursive recall, return=20
> solution, pop return address, return solution, ... , pop=20
> return address, return solution, finished. This is the=20
> negative effect of recursion.  In the iterative version we do=20
> counting instead of accessing the stack.  The dealing with=20
> return addresses and the stack is not used in iteration. =20
> Thats why it is faster. St0fF.

[Dev-C++] Different paths in windows?

[<ste...@ge...>]

Hi all!

I've just finished my latest screensaver-project... Now I have begun =
coding on some installer-prog, but I have a problem. How will I know =
where to install the *.scr file? In Windows 98 it should be in =
C:/windows but in XP it should be in C:/windows/system32... how do i =
check stuff like this?

Thanks!
stein

Re: [Dev-C++] Efficiency

[St0fF 6. <st...@gm...>]

Hi!
As I said, iteration speeds it all up because no unneccessary Stacking,
meaning: push return address, recursive recall, push return address,
recursive recall, ... , recursive recall, return solution, pop return
address, return solution, ... , pop return address, return solution,
finished.
This is the negative effect of recursion.  In the iterative version we do
counting instead of accessing the stack.  The dealing with return addresses
and the stack is not used in iteration.  Thats why it is faster.
St0fF.

----- Original Message -----
From: "Williams, Timothy W." <TIM...@sa...>
To: "'St0fF 64'" <st...@gm...>; "DevCPP"
<Dev...@li...>
Sent: Tuesday, November 13, 2001 1:54 PM
Subject: RE: [Dev-C++] Efficiency


> The fibonacci sequence is given alot as an introduction to recursion so
that
> one isn't first learning recursion at the same time they're learning how
to
> navigate BTree.  That being the case, I assumed he was constrained to
> solving the problem with recursion and I just gave him a more efficient
way
> to do it.  I also don't see any significant performance difference between
> our two solutions, did you?
>
> >>(, and btw. you need more variables ...).
> what's that about?
>
> --tim
>
> > -----Original Message-----
> > From: St0fF 64 [mailto:st...@gm...]
> > Sent: Tuesday, November 13, 2001 7:26 AM
> > To: DevCPP
> > Subject: Re: [Dev-C++] Efficiency
> >
> >
> > HI!
> > Recursive functions normally need a lot more time -> wanna
> > speed it up -
> > ITERATE (do it in one for() / while() construct using only
> > ONE FUNCTION
> > CALL).
> > maybe I'll get it right:
> >
> > int fibonacci_iterated(int max) {
> >     if (max<0) {return 0;}
> >     else {/*register*/ int n=0, m=1,o=1;
> >             for(int i=0;i<=max;i++) {
> >                 m+=n; n=o; o=m;}
> >             return o;}
> > }
> >
> > I mean, if you use C then use it right!  I know some
> > functions are very easy
> > coded recursively,
> > but this implies a lot of stacking and jumping around, and
> > therefore it
> > needs a lot of extra - calling - time.  So if a recursive
> > function should
> > get speeded up, you have to count upwards instead of
> > downwards.  You need to
> > iterate instead of recursing (, and btw. you need more variables ...).
> > Hope this helps,
> > St0fF.
> > ----- Original Message -----
> > From: "Williams, Timothy W." <TIM...@sa...>
> > To: "'Mansoor Nathani'" <man...@sy...>; "Dev users"
> > <dev...@li...>
> > Sent: Friday, November 09, 2001 10:11 PM
> > Subject: RE: [Dev-C++] Efficiency
> >
> >
> > > #include <iostream.h>
> > > #include <stdlib.h>
> > > int fib(int z);
> > > int fib_iter(int a, int b, int count);
> > >
> > > void main(void)
> > > {
> > >  int n;
> > >  cout << "Enter n:\n";
> > >  cin >> n;
> > >  cout << "My Way...\n";
> > >  cout << fib_iter(1, 0, n);
> > >  cout << "\n and now your way...\n";
> > >  cout << fib(n);
> > >
> > > }
> > >
> > >
> > > int fib_iter(int a, int b, int count)
> > > {
> > >     if (count == 0)
> > >        return 1;
> > >     else
> > >       return a+fib_iter(a+b, a, count-1);
> > >
> > > }
> > > int fib(int z)
> > > {
> > > if (z==-1)
> > > return 1;
> > > if (z==-2)
> > > return 0;
> > > else
> > > return (fib(z-1)+fib(z-2));
> > > }
> > >
> > >
> > > > -----Original Message-----
> > > > From: Mansoor Nathani [mailto:man...@sy...]
> > > > Sent: Friday, November 09, 2001 3:46 PM
> > > > To: Dev users
> > > > Subject: [Dev-C++] Efficiency
> > > >
> > > >
> > > > Can any one please show me how to increase the efficiency of this
> > > > recursive program?
> > > >
> > > > THe program is supposed to output the fibonacci sequence
> > up to a given
> > > > value.
> > > >
> > > > I need it to output in the middle of the recursive function, but
> > > > a lot of garbage gets acumulated.
> > > >
> > > > Any help would be appreciated.
> > > >
> > > > Thanks
> > > >
> > > > Mansoor
> > > >
> > > >
> > > > #include <iostream.h>
> > > > int fib(int z);
> > > >
> > > > void main(void)
> > > > {
> > > > int c;
> > > > for (int abc=0;abc<10;abc++)
> > > > cout<<fib(abc)<<endl;
> > > > cin>>c;
> > > > }
> > > >
> > > > int fib(int z)
> > > > {
> > > > if (z==-1)
> > > > return 1;
> > > > if (z==-2)
> > > > return 0;
> > > > else
> > > > return (fib(z-1)+fib(z-2));
> > > > }
> > > >
> > > > _______________________________________________
> > > > Dev-cpp-users mailing list
> > > > Dev...@li...
> > > > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> > > >
> > >
> > > _______________________________________________
> > > Dev-cpp-users mailing list
> > > Dev...@li...
> > > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> >
> >
> >
> >
> >
> >
> >
> > _______________________________________________
> > Dev-cpp-users mailing list
> > Dev...@li...
> > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> >
>
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users

[Dev-C++] Problem with OpenGL

[Max P. <Max...@we...>]

Hi everybody!

I've got a  problem with compiling OpenGL code written in C. When I want to compile this code

#include <windows.h>							
#include <gl\gl.h>						
#include <gl\glu.h>							
#include <gl\glaux.h>

int main(int argc, char** argv)
{
    auxInitDisplayMode (AUX_SINGLE | AUX_RGBA);
    auxInitPosition (0, 0, 500, 500);
    auxInitWindow (argv[0]);

    glClearColor (0.0, 0.0, 0.0, 0.0);
    glClear(GL_COLOR_BUFFER_BIT);
    glColor3f(1.0, 1.0, 1.0);
    glMatrixMode(GL_PROJECTION);
    glLoadIdentity();
    glOrtho(-1.0, 1.0, -1.0, 1.0, -1.0, 1.0);
    glBegin(GL_POLYGON);
          glVertex2f(-0.5, -0.5);
          glVertex2f(-0.5, 0.5);
          glVertex2f(0.5, 0.5);
          glVertex2f(0.5, -0.5);
    glEnd();
    glFlush();
    return 0;
}

it reports that <i>all</i> funcs used are unknown! I am quite sure that there's a problem with the .h files cause in VC++ I got it compiling. Could someone please tell me what to do in order to get this problem solved?
Thanks,
Max
______________________________________________________________________________
Keine verlorenen Lotto-Quittungen, keine vergessenen Gewinne mehr!
Beim WEB.DE Lottoservice: http://tippen2.web.de/?x=7

RE: [Dev-C++] Efficiency

[Williams, T. W. <TIM...@sa...>]

The fibonacci sequence is given alot as an introduction to recursion so that
one isn't first learning recursion at the same time they're learning how to
navigate BTree.  That being the case, I assumed he was constrained to
solving the problem with recursion and I just gave him a more efficient way
to do it.  I also don't see any significant performance difference between
our two solutions, did you?   

>>(, and btw. you need more variables ...).
what's that about?

--tim

> -----Original Message-----
> From: St0fF 64 [mailto:st...@gm...]
> Sent: Tuesday, November 13, 2001 7:26 AM
> To: DevCPP
> Subject: Re: [Dev-C++] Efficiency
> 
> 
> HI!
> Recursive functions normally need a lot more time -> wanna 
> speed it up -
> ITERATE (do it in one for() / while() construct using only 
> ONE FUNCTION
> CALL).
> maybe I'll get it right:
> 
> int fibonacci_iterated(int max) {
>     if (max<0) {return 0;}
>     else {/*register*/ int n=0, m=1,o=1;
>             for(int i=0;i<=max;i++) {
>                 m+=n; n=o; o=m;}
>             return o;}
> }
> 
> I mean, if you use C then use it right!  I know some 
> functions are very easy
> coded recursively,
> but this implies a lot of stacking and jumping around, and 
> therefore it
> needs a lot of extra - calling - time.  So if a recursive 
> function should
> get speeded up, you have to count upwards instead of 
> downwards.  You need to
> iterate instead of recursing (, and btw. you need more variables ...).
> Hope this helps,
> St0fF.
> ----- Original Message -----
> From: "Williams, Timothy W." <TIM...@sa...>
> To: "'Mansoor Nathani'" <man...@sy...>; "Dev users"
> <dev...@li...>
> Sent: Friday, November 09, 2001 10:11 PM
> Subject: RE: [Dev-C++] Efficiency
> 
> 
> > #include <iostream.h>
> > #include <stdlib.h>
> > int fib(int z);
> > int fib_iter(int a, int b, int count);
> >
> > void main(void)
> > {
> >  int n;
> >  cout << "Enter n:\n";
> >  cin >> n;
> >  cout << "My Way...\n";
> >  cout << fib_iter(1, 0, n);
> >  cout << "\n and now your way...\n";
> >  cout << fib(n);
> >
> > }
> >
> >
> > int fib_iter(int a, int b, int count)
> > {
> >     if (count == 0)
> >        return 1;
> >     else
> >       return a+fib_iter(a+b, a, count-1);
> >
> > }
> > int fib(int z)
> > {
> > if (z==-1)
> > return 1;
> > if (z==-2)
> > return 0;
> > else
> > return (fib(z-1)+fib(z-2));
> > }
> >
> >
> > > -----Original Message-----
> > > From: Mansoor Nathani [mailto:man...@sy...]
> > > Sent: Friday, November 09, 2001 3:46 PM
> > > To: Dev users
> > > Subject: [Dev-C++] Efficiency
> > >
> > >
> > > Can any one please show me how to increase the efficiency of this
> > > recursive program?
> > >
> > > THe program is supposed to output the fibonacci sequence 
> up to a given
> > > value.
> > >
> > > I need it to output in the middle of the recursive function, but
> > > a lot of garbage gets acumulated.
> > >
> > > Any help would be appreciated.
> > >
> > > Thanks
> > >
> > > Mansoor
> > >
> > >
> > > #include <iostream.h>
> > > int fib(int z);
> > >
> > > void main(void)
> > > {
> > > int c;
> > > for (int abc=0;abc<10;abc++)
> > > cout<<fib(abc)<<endl;
> > > cin>>c;
> > > }
> > >
> > > int fib(int z)
> > > {
> > > if (z==-1)
> > > return 1;
> > > if (z==-2)
> > > return 0;
> > > else
> > > return (fib(z-1)+fib(z-2));
> > > }
> > >
> > > _______________________________________________
> > > Dev-cpp-users mailing list
> > > Dev...@li...
> > > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> > >
> >
> > _______________________________________________
> > Dev-cpp-users mailing list
> > Dev...@li...
> > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> 
> 
> 
> 
> 
> 
> 
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> 

Re: [Dev-C++] Efficiency

[St0fF 6. <st...@gm...>]

HI!
Recursive functions normally need a lot more time -> wanna speed it up -
ITERATE (do it in one for() / while() construct using only ONE FUNCTION
CALL).
maybe I'll get it right:

int fibonacci_iterated(int max) {
    if (max<0) {return 0;}
    else {/*register*/ int n=0, m=1,o=1;
            for(int i=0;i<=max;i++) {
                m+=n; n=o; o=m;}
            return o;}
}

I mean, if you use C then use it right!  I know some functions are very easy
coded recursively,
but this implies a lot of stacking and jumping around, and therefore it
needs a lot of extra - calling - time.  So if a recursive function should
get speeded up, you have to count upwards instead of downwards.  You need to
iterate instead of recursing (, and btw. you need more variables ...).
Hope this helps,
St0fF.
----- Original Message -----
From: "Williams, Timothy W." <TIM...@sa...>
To: "'Mansoor Nathani'" <man...@sy...>; "Dev users"
<dev...@li...>
Sent: Friday, November 09, 2001 10:11 PM
Subject: RE: [Dev-C++] Efficiency


> #include <iostream.h>
> #include <stdlib.h>
> int fib(int z);
> int fib_iter(int a, int b, int count);
>
> void main(void)
> {
>  int n;
>  cout << "Enter n:\n";
>  cin >> n;
>  cout << "My Way...\n";
>  cout << fib_iter(1, 0, n);
>  cout << "\n and now your way...\n";
>  cout << fib(n);
>
> }
>
>
> int fib_iter(int a, int b, int count)
> {
>     if (count == 0)
>        return 1;
>     else
>       return a+fib_iter(a+b, a, count-1);
>
> }
> int fib(int z)
> {
> if (z==-1)
> return 1;
> if (z==-2)
> return 0;
> else
> return (fib(z-1)+fib(z-2));
> }
>
>
> > -----Original Message-----
> > From: Mansoor Nathani [mailto:man...@sy...]
> > Sent: Friday, November 09, 2001 3:46 PM
> > To: Dev users
> > Subject: [Dev-C++] Efficiency
> >
> >
> > Can any one please show me how to increase the efficiency of this
> > recursive program?
> >
> > THe program is supposed to output the fibonacci sequence up to a given
> > value.
> >
> > I need it to output in the middle of the recursive function, but
> > a lot of garbage gets acumulated.
> >
> > Any help would be appreciated.
> >
> > Thanks
> >
> > Mansoor
> >
> >
> > #include <iostream.h>
> > int fib(int z);
> >
> > void main(void)
> > {
> > int c;
> > for (int abc=0;abc<10;abc++)
> > cout<<fib(abc)<<endl;
> > cin>>c;
> > }
> >
> > int fib(int z)
> > {
> > if (z==-1)
> > return 1;
> > if (z==-2)
> > return 0;
> > else
> > return (fib(z-1)+fib(z-2));
> > }
> >
> > _______________________________________________
> > Dev-cpp-users mailing list
> > Dev...@li...
> > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
> >
>
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users

[Dev-C++] Command line

[<Cuo...@ao...>]

Hello!!!

I wonder if you could show me how to executes the attached program by using 
in the command line method/way on using Microsoft Visual C++ or Dev C++

#include  <iostream.h>
#include  <stdlib.h>
#include <stdio.h>
                
//----------------------------------------------------------------------------

----
// array passed as pointer

float  sum_array( float *A, int len )
{
    float s = 0;
    for( int i = 0; i < len; ++i )
    s += A[i];
    return s;
}

// array passed as array of unspecified length

float  average_array( float A[], int len )
{
    return  sum_array( A, len )/len;
}

//----------------------------------------------------------------------------

----
void  main( int argc, char **argv )
{
    if( argc != 1 )
    {
        cerr << "Usage: " << argv[0] << " number" << endl;
        cerr <<"int argc: "<<argc;
        getchar();
        exit(0);
    }

    int  n = atoi( argv[1] );
    
    float  H[n];
    
    for( int i = 1; i <= n; ++i )
    H[i-1] = 1/float(i);
    
    cout << "harmonic number " << n << ":   " << sum_array( H, n ) << endl;
    cout << "average 1/i up to " << n << ": " << average_array( H, n ) << 
endl;
    
    exit(0);
}

//----------------------------------------------------------------------------

----

[Dev-C++] Dev-C++ 5 preview available on the CVS

[colin <lap...@ep...>]

Hello, 

Dev-C++ version 5 is progressing nicely. You can already take a look at
its current new features on the CVS
(http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/dev-cpp/) 

Download devcpp.exe and lang/english.lng 

enjoy your test and please give feedback ;) 
Colin

Re: [Dev-C++] Text Editor

[Lorenzo <co...@in...>]

> i want it can load big text size (if i use edit controls /API, it's
> limited), have syntax coloring.

try to use richedit control.
----------------------------------------------------------------------------
---
If debugging is the process of removing bugs,
then programming must be the process of putting them in.
----------------------------------------------------------------------------
---

[Dev-C++] Text Editor

[t54n1 <t5...@ya...>]

dear all,

i'm new to Dev-C++ (specially in C/C++).
i've interest to build a text editor (for practicing) and i need your
help (thank fro helping me :))
i want it can load big text size (if i use edit controls /API, it's
limited), have syntax coloring.
please guide me, or you can show me where i found a good tutorials that
have relation.

sorry for my bad english.
thank all.
3LB45

[Dev-C++] (no subject)

[Alex <sum...@be...>]

[Dev-C++] confirmation

[Alex <sum...@be...>]

[Dev-C++] Can anyone suggest a REALLy good C++ book?

[chromatonus 7. <chr...@ho...>]

i just can't get much out of my teacher's instruction. thanks!

_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp

Re: [Dev-C++] how do you use clrscr() and gotoxy() in Dev?

[Jason H. <jas...@bt...>]

The project option is probably disabled because you are editing a C or CPP
file, but didn't open a project for it. To enable project options you will
need to create a new project and add the file you want to it.

Also because you keep asking for a gotoxy() function and a clrscr() function
I have created them for you. There are limitations to these functions. You
have to be in a Windows console for them to work, which if you are using
Dev-C++ console mode you will be, and you have to include <windows.h>. You
may need to link the kernel32.lib (libkernel32.a), but it seems to work
without so it must be automatic, do it if you get a linker error for the
program.

Here is the code, I have made it so that you don't need to worry about
adding anything other than these two functions (and #include <windows.h>),
although I would have prefered to keep copy of the HANDLE hconsoleout as a
global, rather than regetting it for each call.

#include <windows.h>
#include <cstdlib>
#include <iostream>

inline void gotoxy(int x, int y);
inline void clrscr();

int main (int argc, char *argv[])
{

    cout << "Hello";
    gotoxy(25, 10);
    cout << "World!";
    gotoxy(50, 5);
    cout << "I'm Here";

    gotoxy(0,20);
    system("PAUSE");

    clrscr();

    cout << "Hello World" << endl;
    system("PAUSE");

    return 0;
}

inline void gotoxy(int x, int y)
{
  HANDLE hconsoleout;
  hconsoleout = GetStdHandle(STD_OUTPUT_HANDLE);
  COORD XY = {x, y};
  SetConsoleCursorPosition(hconsoleout, XY);
}

inline void clrscr()
{
  HANDLE hconsoleout;
  hconsoleout = GetStdHandle(STD_OUTPUT_HANDLE);
  COORD XY = {0, 0};
  DWORD temp;

  FillConsoleOutputCharacter(hconsoleout, ' ', 80*25, XY, &temp);
  gotoxy(0,0); // goto topleft corner
}

If you have any problems with them just e-mail me and I'll see if I can sort
it out. Note that a normal console window is 80 by 25 in size, but can
sometimes be different, but I haven't acounted for that in clrscr(). And I
don't know what will happen if you try to use a coordinate outside that in
gotoxy(). One more thing, I'm not sure what will happen if you try these
when not in console mode, but it's probably you it will crash as I haven't
checked if the handle is valid. I'm not trying to scare you and it works
fine for me so I wouldn't worry too much.

Jason.

PS: it took me ages to find a function that would get the handle I needed.

----- Original Message -----
From: "chromatonus 712" <chr...@ho...>
To: <dev...@li...>
Sent: Sunday, November 11, 2001 9:56 PM
Subject: [Dev-C++] how do you use clrscr() and gotoxy() in Dev?


> please help...the project option in the toolbar is disabled and i don't
know
> how to use those functions even after i included conio.h in the
> headers...thanks!
>
> _________________________________________________________________
> Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp
>
>
> _______________________________________________
> Dev-cpp-users mailing list
> Dev...@li...
> https://lists.sourceforge.net/lists/listinfo/dev-cpp-users

RE: [Dev-C++] C++

[Ioannis V. <no...@ya...>]

> -----Original Message-----
> From: dev...@li...=20
> [mailto:dev...@li...] On Behalf Of I.Ali
> Sent: Monday, November 12, 2001 2:25 AM
> To: dev...@li...
> Subject: [Dev-C++] C++
>=20
>=20
> Hi All,
>=20
> I am new to programming and decided that I would
> either learn Java or C++, I went with C++ as this is
> in greater demand and is a more powerful and popoular
> langauge than Java, (and pays more too!).
>=20
> Have I done the right thing in beginning to learn C++?


Yes. Then it will be far easier to learn Java if you manage to learn the
whole C++. :)


> Also can anyone recommend the best way to learn C++?


Books. Begin with "Accelerated C++" by Andrew Koenig, Barbara Moo.


Keep in mind that since C++ is the best high level programming language
it will be tough. Operating Systems are written with C++ (or C). :)


Ioannis

* Ioannis Vranos
* Programming pages: http://www.noicys.f2s.com
* Alternative URL: http://run.to/noicys