I was going along smoothly until I hit a rut. I've got the SQL guys giving me some SQL code, but this will require a huge rewrite of a CFC and reduce overall application efficiency.
I'd like to sort a recordset BEFORE outputting it. This cannot be done with SQL as I'm using a QoQ and it lacks any functions to handle such a task.
Here is my query
where tableID in (342,34,532,24,463,14,12,4,643)
I need that order preserved, but of course, since they are IDs, they are returned as a numerical sort and my list order is lost.
I tried to do a bubble sort (I think if I can remember proper terms from the college days) but it took forever.
->copy current pointer row into temp struct, find correct row and move to current, replace found row with tempstruct data.
Maybe this was sloppy, but it took 2.5 seconds to run.
What I need to do is basically reorder those query results back to the original list order. Any high performance suggestions?