Every programming intro book has an example of a 2D array sort. Just
crack a book, or google it. Every sort algorithm will be different.
I presume "snake order" is column major key and row minor key sorting
of the 2D array?
Since the normal row major key column minor key sorting would have
something like this:
for (row = 0; row < MaxRow; row++) {
for (col = 0; col < MaxCol; col++) {
if (other sorting code here)
}
}
What would column major key sorting need to change in that, to make
columns the primary key?
To learn to program, you HAVE to be willing to WORK at it, and
experiment, too. You need code that is not only
accurate in it's answers (always!), but efficient AND easy to
understand (critical with team programming and for maintenance).
No one can hand that kind of knowledge to you, on a silver plate,
even if they wanted to.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
