c 2b 2b sort function time complexity

1nlog(n)

1#include<iostream>  
2using namespace std;  
3int main ()  
4{    
5    int myarray[10] = { 12,4,3,1,15,45,33,21,10,2};   
6       
7    cout<<"\nInput list is \n";
8    for(int i=0;i<10;i++)  
9    {  
10        cout <<myarray[i]<<"\t";  
11    }    
12    for(int k=1; k<10; k++)   
13    {  
14        int temp = myarray[k];  
15        int j= k-1;  
16        } 
17