Quicksort Time Complexity
The number of "work" being done, should be counted with the big-O notation. This means - that you count the while loop as $O(n)$  and any other constant work done (for example, the work after the while) is $O(1)$ and $O(n)+O(1)=O(n)$ so it wont make a difference.

Counting the "work" without big-O is not well-defined in the general case - so you should avoid it altogether