Alphabetical Sort?

bradleyc · 08-30-2005, 01:10 AM

How would i go about creating an Alphabetical Sort?

redhead · 08-30-2005, 02:01 AM

Since you're not specific on if it's C or C++ or if it's supposed to take char* or string or whatnot, I'll advise you to look at strcmp() and work that into your sorting algorithm, that is, if it's supposed to be in C.

bradleyc · 08-30-2005, 02:06 AM

Oh my apologises that would be in C++

Locutus · 08-30-2005, 06:11 AM

Quote:

Originally Posted by bradleyc

How would i go about creating an Alphabetical Sort?

Do you want to know how to write a sorting algorithm, or do you just want to sort stuff?

bradleyc · 08-30-2005, 06:13 AM

Quote:

Originally Posted by Locutus

Do you want to know how to write a sorting algorithm, or do you just want to sort stuff?

Id probably have to say ... just want to sort stuff ...

Valmont · 08-30-2005, 07:58 AM

Bradly... be more serious young lad. C++ isn't easy. Learn to make your coding life easy yet correct. Start with communication. I keep hammering on that to everybody. This isn't a "l33t Gaming Forum".

Salchester · 08-31-2005, 02:36 PM

Locutus,

Out of interest how you would create a sorting alorithm?

Many Thanks

redhead · 08-31-2005, 03:51 PM

Here are a few examples, qsort; quick sort; Numerical Recipes; STL sort, C++ vectors; STL sort, C arrays; Bubble sort theory, theory in string sorting.

I'm sure google can come up with more examples if it is needed...

toe_cutter · 08-31-2005, 05:46 PM

Quote:

Originally Posted by Salchester

Locutus,

Out of interest how you would create a sorting alorithm?

Many Thanks

Not to sound like a jerk, but most programming books have the basic sorting algorithms in them. Honestly just check the index at the back of the book.

Valmont · 08-31-2005, 06:48 PM

In general, the type that is being compared needs to be able to be compared with the same type. For example if you would like to sort integers then at one moment a comparison is needed like:

Code:

if( FirstInt < SecondInt)
{
   //Do stuff.
}

This snippet implies that the type of FirstInt and SecondInt can be compared with eachother.
The class or type they represent needs to be a comparable class or type.

Suppose one wants to sort humans. Such a definition doesn't make much sense. The next refinement is that I may want to sort people by some sort of property they have. This looks reasonable. The whole trick is now to define a class CHuman that is comparable. The same goes for cars, houses, services and whatever you can think of.

Conclusion:
Study the ways of making comparable classes.

Locutus · 09-01-2005, 02:17 AM

Well, yeah. Finding a tutorial on something like Quick Sort or Bubble Sort shouldn't be too hard. The basis for pretty much any sorting algorithm comes down to comparing an item to another and changing the order of the items based on that.

As for sorting stuff, this is probably where Valmont is going, but the standard library contains functions for that. It would help if we had a little more information, like what you're trying to sort, why you're doing it this way, what code you've got so far, etc.