Hello everyone! I am completely stuck trying to build a .exe setup wizard and installer for my software project. I really need some expert help or guidance from a Software Packager or Install Engineer. If anyone has experience with this, please let me know. Any advice is appreciated!
It has been an year now since i wrote my first line of code and i have
gone through many ups and downs, from getting over reliant on LLMs
to getting to know the knowledge gaps that i have in core fundamentals
through out the past year,and 6 months ago i saw an old live stream of
the primeagen writing code without an llm, flying around with his editor
that piqued my interest to learn stuff, so i started with learning to use
vim then neovim on my windows laptop, then switched to fedora 44 ,2 weeks after its launch,then later shifted from KDE plasma to hyprland , and then started building some projects in go,
because before i was using js and i did not like the abstract nature it
had ,i wanted to know things better than what js showed me,and i like the
simple nature of go,these are the projects i built in this order:
1.A terminal Black Jack game
2.A backend clone of splitwise
3.an custom bare-bones implementation of a http 1.1 server
currently i am building a vercel-like application in go, but my main concern is that although i did learn a lot of stuff building these projects, i was not able to design the architecture,think on my own what
should my design be, there was no "my-flavor" in these projects, i either
had a guide or the spec files or had gemini break the project into
small milestones and assignments to achieve each milestone like every guide does,i want to know how do people build projects which truly on their own , like research stuff,think of the high level and low level design ? implementation does not seem like a big enough difficulty to me
compared to these
Firstly go to your browser and type 'minGW compiler', afterwards click on the first link which is of Sourceforge.
Click on the download button, a file named mingw-get-setup.exe will be downloaded, right click on it and select 'open' to start installation process.
Click install, then continue, wait for a while, click continue, select 1st, 2nd, 4th, 5th and 6th option for 'mark for installation'.
Click on installation (top right corner) and select 'apply changes', after the completion close the tab.
Open 'my computer', then C, then minGW, then bin and then copy the path. Go to the start, search environment variables, click on 'edit the system environment variables'
Click on 'environment variables', the in the system variables part double click on the 'path', click on 'new', then paste the copied path. Afterwards click all the 'ok' options.
We have installed the minGW compiler successfully, in order to verify go to start, search 'cmd' and open, type 'g++ --version' and then click enter. You'll see 'Copyright (C) 2016 Free Software Foundation, Inc.This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.'
All the credit goes to the yt channel 'amit thinks'.
Previously I tried to install minGW but faced problems, this time it worked so I decided to post. If there in any mistake please correct me, and forgive me I'm also a beginner.
Guys I've been struggling alot with recursion I've tried multiple tutorials but I'm just not able to build the intuition. Any suggestions what to do???
Please help
I'm developing an A* path router in C++ for an academic project. The router reads a netlist from a netlist.cpp file, finds paths on a 2D grid using A* (Manhattan heuristic, 4‑directional moves), and marks the paths on the grid.
What I have so far:
RoteadorAstar class with a working A* algorithm.#include "netlist.cpp".The next step (second part of the assignment):
I need to generate a textual output file (e.g., .txt) that records all routed paths. The suggested format by my professor is:
start_x,start_y, "movement_string"
where the movement string uses:
^ = up (decrease x)v = down (increase x)< = left (decrease y)> = right (increase y)For example, a path from (2,2) that goes up twice and then right 8 steps would be written as:
2,2, "^^>>>>>>>>"
I need to compute the direction between consecutive points and then group consecutive identical moves into a count (or just repeat the character). A naïve repetition is fine.
Any code snippets or design suggestions for generating this textual output would be greatly appreciated. Thank you!