diff --git a/05-complexity/05-quadratic-time-complexity/readme.md b/05-complexity/05-quadratic-time-complexity/readme.md
index ce5cba05..1d2a5b70 100644
--- a/05-complexity/05-quadratic-time-complexity/readme.md
+++ b/05-complexity/05-quadratic-time-complexity/readme.md
@@ -30,7 +30,7 @@ Due to the nested loops, the time required to execute the sumArray function incr
 
 We can see this by looking at our chart:
 
-![Quadratic Time Complexity](./images/time-complexity.webp)
+![Quadratic Time Complexity](/assets/images/time-complexity.webp)
 
 So in general, quadratic time complexity is not very efficient. However, there are some cases where it is the best or the only solution.