Programming chalenge: Bogosort
-
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
} -
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
}Dude, haven't you heard? The best sorting is probably found in Qt!!!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
}Also I note that the wiki page does not list the Baconsort method. What's wrong with these freaks? Don't they know anything about computer science? //edit (they do now!!) :)
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
modified on Friday, January 28, 2011 4:53 PM
-
Dude, haven't you heard? The best sorting is probably found in Qt!!!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
Why are you trolling, fule. U knw that Qt is only pl imitates of VCF bcoz I say so and am GOING TO SHOUT VERY LOUDLY to hide the paucity of my argument.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
-
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
}Now the entry makes a little more sense, pfft! kthnksby!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Why are you trolling, fule. U knw that Qt is only pl imitates of VCF bcoz I say so and am GOING TO SHOUT VERY LOUDLY to hide the paucity of my argument.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
I was with you till "paucity" - that's way too complicated of a word!!! :)
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Also I note that the wiki page does not list the Baconsort method. What's wrong with these freaks? Don't they know anything about computer science? //edit (they do now!!) :)
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
modified on Friday, January 28, 2011 4:53 PM
you must have added it!
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
-
you must have added it!
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
Me!?? Are you out of your mind?! That's absurd.
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Now the entry makes a little more sense, pfft! kthnksby!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
Thanks for adding bacon to this thread too. :)
Steve Maier
-
Thanks for adding bacon to this thread too. :)
Steve Maier
Sorry got a little carried away, you know a sausage in the hand is worth some bacon in the pan (or something like that).
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Me!?? Are you out of your mind?! That's absurd.
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
Fiend! You accuse me of writing farcebook games, and you go around brazenly wikiediting. Shame shame.
-
Fiend! You accuse me of writing farcebook games, and you go around brazenly wikiediting. Shame shame.
Speak not such foul language Lord Farcebook! Calm your self and realize only thusly: the spoon which you think you doth perceive, cast not it's silvry glint upon thine mind's eye! Think well upon this my friend, and perhaps you may yet take back your rough and uncouth words.
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
-
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
}I prefer this[^] sorting algorithm myself.
Software Zen:
delete this;
Fold With Us![^] -
Speak not such foul language Lord Farcebook! Calm your self and realize only thusly: the spoon which you think you doth perceive, cast not it's silvry glint upon thine mind's eye! Think well upon this my friend, and perhaps you may yet take back your rough and uncouth words.
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
Is this a spoon I see before me?
Henry Minute Do not read medical books! You could die of a misprint. - Mark Twain Girl: (staring) "Why do you need an icy cucumber?" “I want to report a fraud. The government is lying to us all.” I wouldn't let CG touch my Abacus! When you're wrestling a gorilla, you don't stop when you're tired, you stop when the gorilla is.
-
I prefer this[^] sorting algorithm myself.
Software Zen:
delete this;
Fold With Us![^]Why, I outta...........!
Henry Minute Do not read medical books! You could die of a misprint. - Mark Twain Girl: (staring) "Why do you need an icy cucumber?" “I want to report a fraud. The government is lying to us all.” I wouldn't let CG touch my Abacus! When you're wrestling a gorilla, you don't stop when you're tired, you stop when the gorilla is.
-
Dude, haven't you heard? The best sorting is probably found in Qt!!!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
Jim Crafton wrote:
The best sorting is probably found in Qt!!!
:-D And I bet it is twice as efficient as bogosort.
-
Why, I outta...........!
Henry Minute Do not read medical books! You could die of a misprint. - Mark Twain Girl: (staring) "Why do you need an icy cucumber?" “I want to report a fraud. The government is lying to us all.” I wouldn't let CG touch my Abacus! When you're wrestling a gorilla, you don't stop when you're tired, you stop when the gorilla is.
Woo-woo-woo!
Software Zen:
delete this;
Fold With Us![^] -
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
}Most guys would tell you the QuickieSort is the fastest.
-
Just learned about the best sorting algorithm ever: Bogosort[^] Here is my implementation in C++ (note use of C++0x
is_sortedalgorithm):template <class RandomAccessIterator, class Compare>
void bogo_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
{
while (!is_sorted(first, last, comp))
random_shuffle(first, last);
} -
Dude, haven't you heard? The best sorting is probably found in Qt!!!
¡El diablo está en mis pantalones! ¡Mire, mire! SELECT * FROM User WHERE Clue > 0 0 rows returned Save an Orange - Use the VCF! Personal 3D projects Just Say No to Web 2 Point Blow
:-D