natural-sort

In the database, I have various alpha-numeric strings in the following format: 10_asdaasda 100_inkskabsjd 11_kancaascjas 45_aksndsialcn 22_dsdaskjca 100_skdnascbka I want them to essentially be sorted by the number in front of the string and then the string name itself, but of course, characters are compared one by one and so the result of Order by name produces: 10_asdaasda 100_inkskabsjd 100_skdnascbka 11_kancaascjas 22_dsdaskjca 45_aksndsialcn instead of the order I'd prefer: 10_asdaasda 11_kancaascjas 22_dsdaskjca 45_aksndsialcn 100_inkskabsjd 100_skdnascbka Honestly, I would be fine if

For natural sorting in my application I currently P/Invoke a function called StrCmpLogicalW in shlwapi.dll. I was thinking about trying to run my application under Mono, but then of course I can't have this P/Invoke stuff (as far as I know anyways). Is it possible to see the implementation of that method somewhere, or is there a good, clean and efficient C# snippet which does the same thing? My code currently looks like this: [SuppressUnmanagedCodeSecurity] internal static class SafeNativeMethods { [DllImport("shlwapi.dll", CharSet = CharSet.Unicode)] public static extern int StrCmpLogicalW

I'm sorting strings that are comprised of text and numbers. I want the sort to sort the number parts as numbers, not alphanumeric. For example I want: abc1def, ..., abc9def, abc10def instead of: abc10def, abc1def, ..., abc9def Does anyone know an algorithm for this (in particular in c++) Thanks Paul Tomblin I asked this exact question (although in Java) and got pointed to http://www.davekoelle.com/alphanum.html which has an algorithm and implementations of it in many languages. Dominic Rodger This is known as natural sorting. There's an algorithm here that looks promising. Be careful of

How to sort a List based on the item's integer value The list is like "1" "5" "3" "6" "11" "9" "NUM1" "NUM0" The result should be like "1" "3" "5" "6" "9" "11" "NUM0" "NUM1" is there any idea to do this using LINQ or Lambda expression? Thanks in advance How about: list.Sort((x, y) => { int ix, iy; return int.TryParse(x, out ix) && int.TryParse(y, out iy) ? ix.CompareTo(iy) : string.Compare(x, y); }); This is called a "natural sort order", and is usually employed to sort items like those you have, like filenames and such. Here's a naive (in the sense that there are probably plenty of unicode

Is there a natural sort for R? Say I had a character vector like so: seq.names <- c('abc21', 'abc2', 'abc1', 'abc01', 'abc4', 'abc201', '1b', '1a') I'd like to sort it aphanumerically, so I get back this: c('1a', '1b', 'abc1', 'abc01', 'abc2', 'abc4', 'abc21', 'abc201') Does this exist somewhere, or should I start coding? I don't think "alphanumeric sort" means what you think it means. In any case, looks like you want mixedsort . > install.packages('gtools') [...] > require('gtools') Loading required package: gtools > n [1] "abc21" "abc2" "abc1" "abc01" "abc4" "abc201" "1b" "1a" > mixedsort(n)