SCIP can also be used as a pure MIP and MINLP solver or as a framework for branch-cut-and-price.
From my personal experience, I found that most of the resources were just detailing solutions.
Bear in mind, sorting an array can’t be done with a better solution than a O(n log(n)) (like a merge sort for example).
Also, we have to make sure our solution covers all corner cases.
This means that if a problem is solved twice on the same computer with identical parameter settings and no time limit then the obtained solutions will be identical.
If a time limit is set then this may not be case since the time taken to solve a problem is not deterministic. it can exploit multiple cores during the optimization.