Website Summary Files Commits Branches @commit @diff @stats
path: root / Sem. 11 / binarySearch.cpp
diff options
context:
space:
mode:
1 files changed, 0 insertions, 44 deletions
-rw-r--r--Sem. 11/binarySearch.cpp44
diff --git a/Sem. 11/binarySearch.cpp b/Sem. 11/binarySearch.cpp
deleted file mode 100644
index df678ce..0000000
--- a/Sem. 11/binarySearch.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-#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);
-}