do you mind finishing up for me, i feel like my head is about to explode, ive been trying to do this for about a week now, on and off... its ok if you dont, i dont want it to seem like im asking you to do my hw. thanks.
Maybe instead of swapping the missing with the last, we should implement a design to shuffle all of the remaining folks down a notch?
I don't believe that's necessary. The code to swap with the last and decrement num_of_names seems reasonable. I tested with various boundary conditions (rand=0, rand=4) and the program behaved as expected.
I'm still trying to understand the failure conditions. I would suggest adding a count after line 9 so we know the random number generated. Knowing the random number generated might help identify the failure condition. Also, I found it helpful to enter the names in alphabetical order so that when the "not called" list was displayed it was easy to determine if it was correct.
The previously unintended error was that it would swap the last person with the selected, whereas OP wanted to shuffle the remaining user an index closer to zero; ideally moving the "Cat" person to the end while keeping the remaining people within the same order.
It is really the OPs choice whether or not OP wants to swap the last and selected or to shuffle the selected person the the end.
ok just got back from work, ill try them out, the deadline is midnight, i have to do another program but im not going to do that one. ill message back if everything went ok. ty<3 thanks for the help everyone.