From 4a43db6f64dbe6bc7d8f9ee242275e957a96d297 Mon Sep 17 00:00:00 2001
From: Giuseppe Tornello <giuseppe.tornello05@protonmail.com>
Date: Mon, 3 Nov 2025 23:07:08 +0100
Subject: [PATCH 1/4] feat: implemented array search

---
 exercises/verify.cpp | 28 ++++++++++++++++++++++++++--
 1 file changed, 26 insertions(+), 2 deletions(-)

diff --git a/exercises/verify.cpp b/exercises/verify.cpp
index 23356789..2ceccbcb 100644
--- a/exercises/verify.cpp
+++ b/exercises/verify.cpp
@@ -9,10 +9,34 @@ The number 3 is [not] present in the array.
 #include <iostream>
 using namespace std;
 
+bool isPresent(int* Arr, const size_t& size, const int& n);
+void printOutput(bool present);
+
+bool isPresent(int* Arr, const size_t& size, const int& n){
+  for(size_t i = 0; i < size ; i++){
+    if(Arr[i] == n){ return true; } // FOUND!!
+    }
+  return false;
+}
+
+void printOutput(bool present){
+  cout << "The number is ";
+  if(!present){ //not present
+    cout << "not ";
+  }
+  cout << "present in the array." << endl;
+}
+
 int main()
 {
-  // placeholder
-  int N[10] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
+  int N[] = {3, 4, 5, 1, 2, 3, 4, 9, 13, 0};
+  size_t arrSize = 10;
+  int numInput;
+
+  cout << "Insert number: " << endl;
+  cin >> numInput;
+
+  printOutput( isPresent( N , arrSize , numInput) );
 
   return 0;
 }

From 07d4c0e23ff5e4a9b71e240401dfc17cbb73d8d1 Mon Sep 17 00:00:00 2001
From: Giuseppe Tornello <giuseppe.tornello05@protonmail.com>
Date: Tue, 4 Nov 2025 11:57:57 +0100
Subject: [PATCH 2/4] refactor: improved code readability

---
 exercises/verify.cpp | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/exercises/verify.cpp b/exercises/verify.cpp
index 2ceccbcb..426549d1 100644
--- a/exercises/verify.cpp
+++ b/exercises/verify.cpp
@@ -14,7 +14,9 @@ void printOutput(bool present);
 
 bool isPresent(int* Arr, const size_t& size, const int& n){
   for(size_t i = 0; i < size ; i++){
-    if(Arr[i] == n){ return true; } // FOUND!!
+    if(Arr[i] == n){ 
+      return true;// FOUND!!
+      } 
     }
   return false;
 }

From 7c69e4cedd254ee6c844c611c7ab9b4fbcc469e6 Mon Sep 17 00:00:00 2001
From: Giuseppe Tornello <giuseppe.tornello05@protonmail.com>
Date: Wed, 5 Nov 2025 15:25:51 +0100
Subject: [PATCH 3/4] chore: codestyle fix

---
 exercises/verify.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/exercises/verify.cpp b/exercises/verify.cpp
index 426549d1..b4127a4f 100644
--- a/exercises/verify.cpp
+++ b/exercises/verify.cpp
@@ -14,9 +14,9 @@ void printOutput(bool present);
 
 bool isPresent(int* Arr, const size_t& size, const int& n){
   for(size_t i = 0; i < size ; i++){
-    if(Arr[i] == n){ 
+    if(Arr[i] == n){
       return true;// FOUND!!
-      } 
+      }
     }
   return false;
 }

From ac7f36188f6a300763f9df90e9e36df206b71bf2 Mon Sep 17 00:00:00 2001
From: Giuseppe Tornello <giuseppe.tornello05@protonmail.com>
Date: Wed, 5 Nov 2025 21:51:44 +0100
Subject: [PATCH 4/4] fix: indentation pt2

---
 exercises/verify.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/exercises/verify.cpp b/exercises/verify.cpp
index b4127a4f..c98bd581 100644
--- a/exercises/verify.cpp
+++ b/exercises/verify.cpp
@@ -16,8 +16,8 @@ bool isPresent(int* Arr, const size_t& size, const int& n){
   for(size_t i = 0; i < size ; i++){
     if(Arr[i] == n){
       return true;// FOUND!!
-      }
     }
+  }
   return false;
 }