fred

My attempt at solving just one ETH compsci problem.

Why do I make lots of files? Because I always break my own code and have to go back a few steps to find a working version that I can then rebuild with the new code.

The github for all this code is at https://github.com/hpssjellis/fred/tree/main/public/eth

The website demo equivalent of this page is at https://hpssjellis.github.io/fred/public/eth/

  1. ast01.html crap

  2. ast02.html loading array

  3. ast03.html crap

  4. ast04.html crap

  5. ast05.html Presently here getting it parsed, now trying to add distance and time.

  6. split01.html testing splits works but wrong

  7. split02.html bit cleaner but wrong

  8. split03.html trying converted from c++

  9. split04.html showing results

  10. split05.html split and list using recursion not the shift operators. A bit more complex. I probably will not use this.

  11. ast06.html Kind of doing stuff, not really working yet. An OK code backup

  12. ast07.html Potion add may be wrong

  13. ast08.html latest as a proper link

LOL, I understood the question wrong. I thought the distance and times must be added in the order given.

  1. max-d-min-t01.html Attempt to optimise a list of distance and time for max distance min time

  2. max-d-min-t02.html works

  3. max-d-set-t01.html now with set time indicies are bad

  4. max-d-set-t02.html attempt 2

  5. max-d-set-t03.html attempt 3, Now this works.

  6. max-d-set-t04.html BigInt safe

  7. max-d-split-t01.html add split and list (meet in the middle code) Uggghh it is incorrect somehow. Back to the BigInt safe method

  8. max-d-set-t04.html BigInt safe