Calculate the run-time complexity for the worst-case scenario of the following algorithm:

1. int s = 0;

2. if (N>10){

3. for (int i = 0; i < N; i++){

4. for (int j = i; j < N; j++){

5. s += (i * j) ^ 2;

6. }

7. }

8. }

9. else{

10. for (int i = 0; i < N; i++){

11. for (int j = 0; j < N; j++){

12. s += (i * j) ^ 2;

13. }

14. }

15. }

16. return s