Sorter

I have mostly finished the week organizer in c++, but I am not as happy with it as I thought I’d be. There are some small problems that could be solved manually each time, but that’s not how I want it to work. I want it fully automated. From the last update I have only added a few things to make it run smoother and fix some small mistakes like, like adding a memory for each day, so one person doesn’t show up two times in a day.
I think I should rework this design a bit and I want to use a matrix instead of a string, which I don’t know why I didn’t use from the beginning, like it’s so much better for this.
I’ll keep on working on this and improving it and I’ll post soon… :>

After working around eight and a half hours on the c++ script for this sorter, how I call it, I’ve finally made the platform from which I’ll build everything else.
How it works? Well, basically, you input the path to your .txt file containing all the info you want to input, the info being in the form of a lot of users, each user having his for lines, first: being the name, second: time of day, third: type of training and fourth: some exceptions that may exist for the said user.
Next, the script reads the file and creates a list with all the users and their info. After that it creates a long string that contains all the users, sorted into days of the week and times of days. It calculates it so it uses the least hours of day per week, and so that everyone has the same amount of appointments as it says in the file.
For good measure, I have a function to count how many times each user appears in the string, so I know if there is an error.
That’s all for now (the segmentation errors took a lot of time…), and I’ll keep working and posting about this project! :D