Trying Something New To Experiment with

[joebenjamin]

Im tring an experiment that will generate 7000 integer random numbers and
save them in an array. Then I need to copy these 7000 values into a second
array, so that I have two identical integer arrays.
In a function, I want to sort the first array with an un-optimized bubble
sort.
In a second function, I want to sort the second array with an optimized
bubble sort.

So in the main, I would like to print out the time each sort routine took
to execute and print out a message determining which sort routine was
faster.

Any Ideas, I made this one up for fun to also learn how to do arrays and
counts.
Any help would be appreciated.....

--
Message posted using http://www.talkaboutprogramming.com/group/comp.lang.c/
More information at http://www.talkaboutprogramming.com/faq.html

[Army1987]

On Mon, 17 Sep 2007 04:18:57 -0400, joebenjamin wrote:

Im tring an experiment that will generate 7000 integer random numbers and
save them in an array. Then I need to copy these 7000 values into a second
array, so that I have two identical integer arrays.
In a function, I want to sort the first array with an un-optimized bubble
sort.
In a second function, I want to sort the second array with an optimized
bubble sort.

Optimized bubble sort?

So in the main, I would like to print out the time each sort routine
took to execute and print out a message determining which sort routine
was faster.

#include <time.h>
int main(void)
{
clock_t start, end;
double t0, t1;
start = clock();
func0(arr0, 7000);
end = clock();
t0 = (double)(end - start) / CLOCKS_PER_SEC;
/* Now t0 is the *processor* time elapsed by func0. Repeat the
* same for func1, compare them, print them, etc. */
return 0;
}

Any Ideas, I made this one up for fun to also learn how to do arrays and
counts.

Is there anybody still taking bubblesort seriously? Isn't it just a
teaching toy? No, I'm told that it predates selection sort and insertion
sort... But I still can't imagine how anybody could come up with something
like that having serious purposes.

--
Army1987 (Replace "NOSPAM" with "email")
If you're sending e-mail from a Windows machine, turn off Microsoft's
stupid “Smart Quotes� feature. This is so you'll avoid sprinkling garbage
characters through your mail. -- Eric S. Raymond and Rick Moen

[Willem]

joebenjamin wrote:
) Im tring an experiment that will generate 7000 integer random numbers and
) save them in an array. Then I need to copy these 7000 values into a second
) array, so that I have two identical integer arrays.
) In a function, I want to sort the first array with an un-optimized bubble
) sort.
) In a second function, I want to sort the second array with an optimized
) bubble sort.
)
) So in the main, I would like to print out the time each sort routine took
) to execute and print out a message determining which sort routine was
) faster.
)
) Any Ideas, I made this one up for fun to also learn how to do arrays and
) counts.

I'm not sure what it is you want help with... In any case, this may be
useful: (Quoted from the manual:)

The clock() function determines the amount of processor time used since
the invocation of the calling process, measured in CLOCKS_PER_SECs of a
second.

SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

[CBFalconer]

joebenjamin wrote:

>
Im tring an experiment that will generate 7000 integer random
numbers and save them in an array. Then I need to copy these 7000
values into a second array, so that I have two identical integer
arrays. In a function, I want to sort the first array with an
un-optimized bubble sort. In a second function, I want to sort
the second array with an optimized bubble sort.

So in the main, I would like to print out the time each sort
routine took to execute and print out a message determining which
sort routine was faster.

Sounds simple, so just do it. However you should realize that a
bubble sort is fundamentally unsound in that it is inefficient.
Also, you don't need to save the original sequence (unless you have
other different uses for it) since you can save the initializing
value for the rand (or random) function, and thus reset it to
regenerate the same sequence.

--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>
--
Posted via a free Usenet account from http://www.teranews.com

[pete]

Army1987 wrote:

>
On Mon, 17 Sep 2007 04:18:57 -0400, joebenjamin wrote:

Any Ideas, I made this one up for fun
to also learn how to do arrays and counts.

Is there anybody still taking bubblesort seriously?

He said "for fun".

Isn't it just a teaching toy?

That's also what he said.

--
pete

[Tor Rustad]

pete wrote:

Army1987 wrote:

>On Mon, 17 Sep 2007 04:18:57 -0400, joebenjamin wrote:

>>Any Ideas, I made this one up for fun
to also learn how to do arrays and counts.

>Is there anybody still taking bubblesort seriously?

He said "for fun".

>Isn't it just a teaching toy?

That's also what he said.

It smelled like homework to me.

--
Tor <torust [at] online [dot] no>

[pete]

Tor Rustad wrote:

>
pete wrote:

Army1987 wrote:

On Mon, 17 Sep 2007 04:18:57 -0400, joebenjamin wrote:

>Any Ideas, I made this one up for fun
to also learn how to do arrays and counts.

Is there anybody still taking bubblesort seriously?

He said "for fun".

Isn't it just a teaching toy?

That's also what he said.

It smelled like homework to me.

I wrote one for fun and to learn a little about sorting.

http://www.mindspring.com/~pfilandr/...ver/e_driver.c
http://www.mindspring.com/~pfilandr/C/e_driver/

--
pete