I'll give an example. At my previous company there was a program where you basically select a start date, select an end date, select the system and press a button and it reaches out to a database and pulls all the data following that matches those parameters. The horrors of this were 1. The queries were hard coded.

They were stored in a configuration file, in xml format.
The queries were not 1 entry. It was 4, a start, the part between start date and end date, the part between end date and system and then the end part. All of these were then concatenated in the program intermixed with variables.
This was then sent to the server as pure sql, no orm.
Here's my favorite part. You obviously don't want anyone modifying the configuration file so they encrypted it. Now I know what you're thinking at some point you probably will need to modify or add to the configuration so you store an unencrypted version in a secure location. Nope! The program had the ability to encrypt and decrypt but there were no visible buttons to access those functions. The program was written in winforms. You had to open the program in visual studio, manually expand the size of the window(locked size in regular use) and that shows the buttons. Now run the program in debug. Press the decrypt button. DO NOT EXIT THE PROGRAM! Edit the file in a text editor. Save file. Press the encrypt button. Copy the encrypted file to any other location on your computer. Close the program. Manually email the encrypted file to anybody using the file.

you are viewing a single comment's thread
view the rest of the comments

[–] chocrates@piefed.world 12 points 2 days ago (2 children)

I wrote an algorithm that should be recursive but in expediency I wrote a loop that iterates 10 times.

It's fine but I'm still mad 3 weeks later

[–] DrFunkenstein@sh.itjust.works 6 points 2 days ago (1 children)

Good chance that's more performant though, compilers can flatten for loops and you don't have to waste as much time creating new stack frames each time you recurse

[–] chocrates@piefed.world 1 points 1 day ago

It might, I'm mostly mad because it seems like a classic recursion problem. Build a graph of nested references.

[–] Fiery@lemmy.dbzer0.com 2 points 1 day ago

I had to rewrite an iterative implementation I made for an exercise in school because the solution they prepared used recursion. I'm still mad about that. Admittedly the recursive solution was a tiny bit more elegant, but my solution worked too!