finish another question in assignment 1

1 files changed, 17 insertions, 0 deletions

diff --git a/0x01/README.md b/0x01/README.md
index ee4fe11..60d2bc8 100644
--- a/0x01/README.md
+++ b/0x01/README.md
@@ -131,6 +131,23 @@ Submit your solutions to the following exercises and problems:
     about in the worst case? What are the average-case and worst-case running
     times of linear search in O-notation? Justify your answers.
 
+    How many elements of the input sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array?
+
+      Since there are `n` elements the average would be in the middle (.i.e. `𝚯(n/2)`).
+      When we drop the lower order terms this becomes `𝚯(n)`. Hence, the term
+      linear search.
+
+    How about in the worst case?
+
+      In the worst case you need to search check every element in the input.
+      Because of this the worst case would be equal to the size of the input.
+      i.e. `𝚯(n)`.
+
+    What are the average-case and worst-case running times of linear search in 𝚯-notation?
+
+      When we drop lower order terms, like constants then they are both `𝚯(n)`
+
+
 1. Exercise 2.3-5 from the textbook (10 marks)
 
     Referring back to the searching problem (see Exercise 2.1-3), observe that