Search DaniWeb - executation

Radix Sort C++ with Time Executation 9 Years Ago by Diellza How to make the code with Random numbers and Time Executation? #include <iostream> /* cout */ #include <cstdlib> /* srand, … How to make Caounting sort with random numbers and Time executation 9 Years Ago by Diellza … to make this code with random numebr array and time executation? Does anybady nows how can I do? #include <iostream… Re: How to make Caounting sort with random numbers and Time executation 9 Years Ago by Diellza Here is the code for time executation, but I don't know were to put this code clock_t tn, tp; srand(time(NULL)); tn = clock(); tp = clock(); Re: Radix Sort C++ with Time Executation 9 Years Ago by NathanOliver Did you copy this code from somewhere? I have a hard time believing that you could produce this code and not know how to generate random numbers. Re: Radix Sort C++ with Time Executation 9 Years Ago by Diellza Yes I sow it in one website, but how can I do it with random numbers? Can You help me Re: Radix Sort C++ with Time Executation 9 Years Ago by necrovore Line 24 of the code you posted `rand()%1000 + 1;` is generating random numbers. rand() function generates a random number, %1000+1 makes sure that you get a number not exceeding 1000. SO you get a random number not exceeding 1000 Re: Radix Sort C++ with Time Executation 9 Years Ago by richieking So what is your problem now?? Do you have any issues?? Re: Radix Sort C++ with Time Executation 9 Years Ago by Diellza No it's ok thanks pygtk dynamic table 17 Years Ago by JyotiC … size, but that can be increased any time during the executation of the code. what i have tried, is that i… Counting Sort with Random numbers and Time 9 Years Ago by Diellza … a code for QuicSort algorithm with random numbers and time executation but now I want to do for Countin sort And… Re: c++ Timer? 17 Years Ago by Ancient Dragon … again after the code finished. The difference is the approximate executation time. Since the code runs very quickly you probably have… Re: c++ Timer? 17 Years Ago by Duki … again after the code finished. The difference is the approximate executation time. Since the code runs very quickly you probably have… Re: c project 17 Years Ago by Ancient Dragon >>but its not working properly what doesn't it do that you want it to? Not everyone has your compiler so you need to explain what it does wrong. Compile errors? executation errors? Re: #if directive issue 15 Years Ago by Ancient Dragon … sees the #ifdef directive. Nor is it affected at program executation time. The [b]condition[/b] must be satisfied before compile… Re: Create COMServer with low priviledge 15 Years Ago by Ancient Dragon what do you mean by "low privilege" ? Low executation priority ? If so then forget it because all that will do is cause your server to get little, if any, cpu time even when needed. Better to put the server into a wait state until an event occurs, such as receipt of a message from clients to do something. Re: Methods, Async Methods 10 Years Ago by Sphinx'LostNose … for getting results, and this switch back to its original executation path? If so, that would seem like a thread that… Re: Starting " C " 10 Years Ago by Ancient Dragon … significance of using an interpreter rather than a compiler ? AFIK executation speed. It's a little like the difference between walking… Re: Bucket Sort with timing 9 Years Ago by Diellza Dear Vegasite how to generate time executation for each random number that is sort? import time import … Re: pygtk dynamic table 17 Years Ago by bumsfeld Seems that Linux folks use GTK and pygtk for GUI work. It looks like a good GUI, but I use the Windows OS and the whole installation process of GTK/pygtk and all the additional required things is very cumbersome. I personally like wxPython a lot. Why did you choose to go with GTK? Re: pygtk dynamic table 17 Years Ago by JyotiC I am making a tool for GCC. And GTK is standards of GCC. So, my guide told me to use it. Re: Counting Sort with Random numbers and Time 9 Years Ago by David_50 The algorythm is pretty simple. The assumption is that there are many duplicate keys, so you can count each and deliver them, a bit like loading shelves. Each key has a first position in the output array discovered by scanning, counting, adding. As items are positioned in the output, the first position for that key is incremented. http://en.… Re: Counting Sort with Random numbers and Time 9 Years Ago by Diellza Dear David you mean for x in input: count[key(x)] += 1 # calculate the starting index for each key: total = 0 for i in range(k): # i = 0, 1, ... k-1 oldCount = count[i] count[i] = total total += oldCount # copy to output array, preserving order of inputs with equal keys: for x… Re: Counting Sort with Random numbers and Time 9 Years Ago by David_50 Something like that. I interpert it that, if I did a first read of the input file, I could count the instances of each key in a container of keys and counts. Then, the new offsets are defined by (the sum of lower keys plus the sum of earlier instances of this key) times the (fixed length) item length. So, on the second sequential read, each item…