From ae90cb76ace17c6a2b0bee34d151242855ca5bab Mon Sep 17 00:00:00 2001
From: Angel Dimitriev <achi_d@abv.bg>
Date: Mon, 15 Nov 2021 16:52:00 +0200
Subject: Add files via upload

---
 Sem. 06/linearSearch.cpp | 45 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 Sem. 06/linearSearch.cpp

(limited to 'Sem. 06/linearSearch.cpp')

diff --git a/Sem. 06/linearSearch.cpp b/Sem. 06/linearSearch.cpp
new file mode 100644
index 0000000..d5d2ff1
--- /dev/null
+++ b/Sem. 06/linearSearch.cpp	
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+
+bool linearSearch(const int arr[], unsigned size, int el)
+{
+	for (unsigned i = 0; i < size; i++)
+	{
+		if (arr[i] == el)
+			return true;
+	}
+	return false;
+}
+
+bool binarySearch(const int arr[], unsigned size, int searched)
+{
+	unsigned fromIndex = 0;
+	unsigned toIndex = size - 1;
+
+	while (fromIndex <= toIndex)
+	{
+		unsigned midIndex = fromIndex + (toIndex - fromIndex) / 2;
+
+		if (arr[midIndex] == searched)
+			return true;
+
+		if (arr[midIndex] < searched)
+			fromIndex = midIndex + 1;
+		else
+			toIndex = midIndex - 1;
+	}
+
+	return false;
+}
+
+
+
+int main()
+{
+	const unsigned SIZE = 8;
+	int arr[]  { 1, 12, 33, 14,35,4,17,38};
+	cout << linearSearch(arr, SIZE, 14);
+}
+
-- 
cgit v1.3.1-23-gd82d