williamjcm/small3dlib
1
0
Fork 0
mirror of https://git.coom.tech/drummyfish/small3dlib.git synced 2024-11-21 20:39:57 +01:00
Code Activity

Use insertion sort

Browse source
This commit is contained in:
Miloslav Číž 2019-05-28 15:55:25 +02:00
parent 9fe207eebe
commit 6cdae481df
1 changed files with 25 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
small3dlib.h
View file

@ -1891,17 +1891,33 @@ void S3L_drawScene(S3L_Scene scene)
} }
#if S3L_SORT != S3L_SORT_NONE #if S3L_SORT != S3L_SORT_NONE
// TODO: CHANGE BUBBLE SORT TO SOMETHING FASTER!
for (int16_t i = S3L_sortArrayLength - 2; i >= 0; --i) #if S3L_SORT == S3L_SORT_BACK_TO_FRONT
for (S3L_Index j = 0; j <= i; ++j) #define cmp <
#else
#define cmp >
#endif
/* Sort the triangles. We use insertion sort, because it has many advantages,
especially for smaller arrays (better than bubble sort, in-place, stable,
simple, ...). */
for (int16_t i = 1; i < S3L_sortArrayLength; ++i)
{ {
if (S3L_sortArray[j].sortValue < S3L_sortArray[j + 1].sortValue) S3L_TriangleToSort tmp = S3L_sortArray[i];
int16_t j = i - 1;
while (j >= 0 && S3L_sortArray[j].sortValue cmp tmp.sortValue)
{ {
S3L_TriangleToSort tmp = S3L_sortArray[j]; S3L_sortArray[j + 1] = S3L_sortArray[j];
S3L_sortArray[j] = S3L_sortArray[j + 1]; j--;
}
S3L_sortArray[j + 1] = tmp; S3L_sortArray[j + 1] = tmp;
} }
}
#undef cmp
for (S3L_Index i = 0; i < S3L_sortArrayLength; ++i) for (S3L_Index i = 0; i < S3L_sortArrayLength; ++i)
{ {