I have written a quicksort algo that works fine on a array of ints. My problem however is that I will be sorting a few millions structs based on its int member.
My task has to split the few millions structs into sections of 750. So I will have 750 structs then list will be another 750 structs and then list will have another 750 all the way to a few million. So my question is how can I sort the array when it is structured in this seperated way, or can I just create the structs in one large array say struct MyList mine and then input the sorted data into the seperated sections.
I hope this is clear, thanks.
A bit more explanation, I would have a structure like:
struct obj->int value to sort by
So in this case there would be 10 entries of 6 structs. So 60 obj structs all together that need to be sorted by their int value. However in real scale there would be maybe 3-4 million obj structs, so I dont think I can do struct obj list and sort that, I would have to sort it in its seperated form.