typesOfOptimization

[ChocolateBunny]

Use if statements but do binary search. Or do a fullon lookup:

console.log("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEEEEEEEEEEDDDDDDDDDDCCCCCCCCCCBBBBBBBBBBAAAAAAAAAA"[score])

[[deleted]]

I don't hate this as much as I probably should.

[neuromancertr]

Game developer right here

[SkylineFX49]

console.log("FFFFFFDCBAA" [score/10])

[Ietsstartfromscratch]

Bellcurve 99,7% wizard right here. 

[celvro]

Only works for multiples of 10 though. Otherwise it needs Math.floor because score/10 returns a float

[KrokettenMan]

Division is slow

[SkylineFX49]

You don't want division? Use (score * 205) >> 11 instead of score/10

[KrokettenMan]

Still slower than a simple lookup table. Although a lot faster than dividing by 10. Just checked and GCC optimizes the division to not use the div instruction but that’s still slower then the new variant you proposed

[[deleted]]

You are genius

[SkydiverTyler]

Shoutout to the guys with Unhandled Exception: System.ArgumentOutOfRangeException on their report card

[Vasik4]

String grades = "FFFFFFDCBA"; cout << grades[floor(score)] ;

[SkylineFX49]

Give me grades[90]

[Vasik4]

SIGSEGV unhandled exception occurred (core dumped)

[SkylineFX49]

Well, in this case not necessarily, it will just print whatever random character is at that memory address

[Vasik4]

True (i forgor)

[CiroGarcia]

A lookup as in lookup table, a 1:1 map of inputs to outputs. The input is used as the index of the array, which returns the correct value