From babbe2009e291e0cd9b0e1697298ddc91a2686be Mon Sep 17 00:00:00 2001
From: Ayush Dwivedi <ayushdwivedi8756326270@gmail.com>
Date: Fri, 10 Apr 2026 20:04:25 +0530
Subject: [PATCH] Improve linear_search.cpp documentation and naming

- Added time and space complexity
- Improved return description
- Updated function naming for better readability
---
 search/linear_search.cpp | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/search/linear_search.cpp b/search/linear_search.cpp
index 268aa52c3ac..b11f929591f 100644
--- a/search/linear_search.cpp
+++ b/search/linear_search.cpp
@@ -16,9 +16,13 @@
  * \param [in] size length of array
  * \param [in] key key value to search for
  * \returns index where the key-value occurs in the array
- * \returns -1 if key-value not found
+ * @returns index of the key if found, otherwise -1
  */
-int LinearSearch(int *array, int size, int key) {
+/**
+ * Time Complexity: O(n)
+ * Space Complexity: O(1)
+ */
+int linearSearch(int *array, int size, int key) {
     for (int i = 0; i < size; ++i) {
         if (array[i] == key) {
             return i;