-
I need some people to help me test a DLL that I am writing.
If you want to be able to sort an array rapidly, then you should check this out.
It includes the ability to sort partial arrays, reverse order (numerical and textual) and take a safety backup of the data in case of error.
The main algorithms are based on the QuickSort and CountingSort models. (the counting sort is able to completely sort an integer array of any size in 1 pass, either forward or backwards).
Mail me if you want a free sample.
-
ahh yes, but can you oh smart one give the big O notation for them?
how come you decided to make this dll?? just out of boredom? I did something similiar once, where I had numerous sorts, such as merge sort, quick sort, bubble sort, bucket sort. I had a graphical display and then when the user click start they would all start running. I also had a combo box, were one could select the best, worst and average cases for the sorts. If you are interested more in sorts you should check out a book written by Cormen (or something like that, I will check up and update this) it is pretty well done. It goes over all kinds of algorithms and structures.
-
Sorry wasnt trying to put attitude. I was trying to compliment you, because some people never actually utilize alogorithms that are present in computer science. I was also trying to challenge you, to see if you would try to discover what the big O notation was for them.
The combo box didnt allow users to rate things, as you know with sorting, depending upon the array it takes in, the sort will run the best it can, or the average of it,or the worst, as you probably know some sorts run the best when they are given a sorted array, were as some others run their worst when given a sorted array, some run horribly when the array is completely opposite (decreasing) were as some run really fast the other way. So when a user selected say best case you would see the best arrays for the sorts,and see them run through them. Same for the worst case. It would be very hard sometimes for a user to tell the difference for it could be a matter of small time differences.
In case you want to know, Big O notation is the way you can see the performance of an alorithm, for example the best that a sort can run in, (so if someone could design one to always run in) O(n) (they would be rich). Most sorts run around O(n log n).
-
Sorry i beat up on ya there it wasnt called for.
-
could i get a copy of the dll? I might give it a real through testing but will walk through a couple.
