3 ms·
Every original algorithm ( or even an original GUI component) has its pending original data structure. Designing an algorithm most often starts by identifying i
by bsaul 12y ago
Every original algorithm ( or even an original GUI component) has its pending original data structure. Designing an algorithm most often starts by identifying its parts and most adapted storage&query structure.
I suppose you're just writing boilerplate code, assembling pre coded components within the boundaries of a framework... That's the kind of boring job i usually try to let interns or beginners do, mostly because it's not economically interesting for customers to have that kind of job performed by senior devs/architect ( it does take more time than brain).
- mattmanser 12y agoYeah, that's exactly what I'm doing. Or not. We're way past the decades where you had to sit around "thinking" for ages to come up with a data structure. You still loading the program up on cards or something? You saying it is as preposterous as the guy I met a couple of years back who offered to come and design SQL DBs for me. It's just not done any more. That's not how we work any more, that time has past. In today's world you can prototype up the basics of any complex system in an hour or two and throw it away if it doesn't work. Tests are cheap, it's easy to mock, there's no compilation to worry about. And if you can't look at a problem and immediately see the effective ways you've solved similar problems before, well, you're not as senior dev/architect as you think you are. You simply sound dated to me.
- bsaul 12y agoIt is indeed a very dated method, but you should try it once. You'll see that by thinking first, coding later, you'll gain a lot of time overall ( you're not always able to see with your code that something doesn't work). Now of course you don't need this method for trivial things, but i hope that's not what you spend most of your time working on. Note: i didn't downvote you.