[RESOLVED] Sorting small arrays. Witch algo is fastest.

Quote:

---

Originally Posted by NoteMe

float distX = (wPoints[0].X + wPoints[1].X + wPoints[2].X + wPoints[3].X) / 4;
float distZ = (wPoints[0].Z + wPoints[1].Z + wPoints[2].Z + wPoints[3].Z) / 4;
Position = new Vector(distX, distZ, 1.5f);


hehe..but no one noticed that I forgot to change it here too..:D


- ØØ -

---

Can't you do any bit shifting in C#?

DoomSharp();
- Will make you look ridiculous.

:D

Yeah you can...what do you think about...the division on four?
How do you do that with floates?

<< 2???


- ØØ -

sorry my bad :blush:

Quote:

---

Originally Posted by kedaman

sorry my bad :blush:

---

Good to see that it is not only me that is tired right now..:)...I can't even get my head around this bounding cricle stuff...:)


- ØØ -

Quote:

---

Originally Posted by kedaman

You've totally lost me. There are only one floor and ceiling, and theyre connected to the wall, so that its either in front or behind it. If the walls have thickness, they can only be in front of it, given that the wall is front facing which is necessary if its going to be rendered.

---

My assumption was that the floor and ceiling were tiles, rather than a single surface for each.

This is based on the artefacts shown in the image - in the closest "problem" two or three floor tiles have been drawn after the wall "in front" of them, and the wall to the left has been drawn afterwards.

I could be wrong of course!!

Quote:

---

Originally Posted by si_the_geek

My assumption was that the floor and ceiling were tiles, rather than a single surface for each.

This is based on the artefacts shown in the image - in the closest "problem" two or three floor tiles have been drawn after the wall "in front" of them, and the wall to the left has been drawn afterwards.

I could be wrong of course!!

---

Yeah I know what you mean, but these walls were billboarded.. anyway I think in this case its best to go with this method.

Anyway

Quote:

---

float distX = (wPoints[0].X + wPoints[1].X + wPoints[2].X + wPoints[3].X) / 4;
float distZ = (wPoints[0].Z + wPoints[1].Z + wPoints[2].Z + wPoints[3].Z) / 4;

---

I was thinking about this again, do you really need the distance other than for sorting? if not then you could leave out the division by 4, because they will still be the same order ;)

Quote:

---

Originally Posted by kedaman

I was thinking about this again, do you really need the distance other than for sorting? if not then you could leave out the division by 4, because they will still be the same order ;)

---

I was actualy thinking about that on the bus on my way home this morning too..:)...I think you are right...

- ØØ -

hehe, great minds :)

Thinking about it again. The position never changes in world coordinates..;)..so I had this function in the constructor..:D..so why even bother to optimize the calculation of the position..:D:D:D:D:


- ØØ -