diff --git a/5. Lists/Easy/9. Linear Seach/optimal.py b/5. Lists/Easy/9. Linear Seach/optimal.py
index 3ba7200..3396989 100644
--- a/5. Lists/Easy/9. Linear Seach/optimal.py	
+++ b/5. Lists/Easy/9. Linear Seach/optimal.py	
@@ -1,3 +1,5 @@
+# This is a linear search code with time complexity O(n)
+# :)
 def linearSearch(n: int, num: int, arr: [int]) -> int:
     for i in range(0, len(arr)):
         if arr[i] == num: