can anyone give me a time complexity java code for the best case worst case and average case of sorting algorithms i have created the following algorithms

Merge Sort

Quick Sort

Binary Search

Insertion Sort

all of them return the running time of the algorithm but i need a code that will show me the best case worst case and average case of the algorithm any ideas, i have exhausted google but no luck.

thanks in advance!