Tining analysis, namely worst-case execution time (WCET) analysis is a focal research theme in real-time systems feasibility assessment. despite its high importance, it exhibits high complextity of analysis as the software gets more complex. high complexity and unpredictability in timing analysis arise as the program code contains a lot of possible paths, which are dependent on the input values. with the sinngle execution path paradigm, timing analysiscan be made simpler. throughout this paper, bubble short and selection sort algorithms are presented, modified in single path approach, and tested. the if-statements are the targets of this modification. the expriment shows that it is possible to generate single path codes without having to modify the low level code and the results signify improvements on the temporal predictability.