Summary Files Commits Branches @commit @diff @stats
path: root / Year 1 / Programming introduction / Solutions Sem. 06 / exercise06.cpp
diff options
context:
space:
mode:
Commitd6e6b0328ce2a4fe228262713e89e391421f5ab3 (patch)
Author
 Syndamia <kamen.d.mladenov@protonmail.com>
2021-11-17 09:26:15 +0200
Committer
 Syndamia <kamen.d.mladenov@protonmail.com>
2021-11-17 09:26:15 +0200
Files3ae1ab57c1cfc722fc24a26e2e0d2c403b8527d4 /Year 1/Programming introduction/Solutions Sem. 06/exercise06.cpp
uni-projects-d6e6b0328ce2a4fe228262713e89e391421f5ab3.tar
uni-projects-d6e6b0328ce2a4fe228262713e89e391421f5ab3.tar.gz
uni-projects-d6e6b0328ce2a4fe228262713e89e391421f5ab3.zip
Parentb02c6e3dc1917eedf2791bd89b9e3c80e6f1ef9f (diff)
Added my solutions to Sem. 06 exercises
1 files changed, 49 insertions, 0 deletions
-rw-r--r--Year 1/Programming introduction/Solutions Sem. 06/exercise06.cpp49
diff --git a/Year 1/Programming introduction/Solutions Sem. 06/exercise06.cpp b/Year 1/Programming introduction/Solutions Sem. 06/exercise06.cpp
new file mode 100644
index 0000000..6c52db3
--- /dev/null
+++ b/Year 1/Programming introduction/Solutions Sem. 06/exercise06.cpp
@@ -0,0 +1,49 @@
+#include <iostream>
+
+using namespace std;
+
+int smallestRemovedNumber(int nums[], int len) { // Works only for non-negative numbers
+ int pivot = len / 2, diff = 0, smallest = -1, biggest = 0;
+
+ while (pivot > 0) {
+ // Pivot going to the left
+ if (nums[pivot - 1] + 1 != nums[pivot])
+ smallest = nums[pivot] - 1;
+
+ // Pivot going to the right
+ if (nums[pivot + diff] + 1 != nums[pivot + diff + 1])
+ biggest = nums[pivot + diff] + 1;
+
+ diff += 2 + (pivot % 2);
+ pivot /= 2;
+ }
+
+ return (smallest == -1) ? biggest : smallest;
+}
+
+int biggestRemovedNumber(int nums[], int len) { // Works only for non-negative numbers
+ int pivot = len / 2, diff = 0, smallest = 0, biggest = -1;
+
+ while (pivot > 0) {
+ // Pivot going to the left
+ if (nums[pivot - 1] + 1 != nums[pivot])
+ smallest = nums[pivot] - 1;
+
+ // Pivot going to the right
+ if (nums[pivot + diff] + 1 != nums[pivot + diff + 1])
+ biggest = nums[pivot + diff] + 1;
+
+ diff += 2 + (pivot % 2);
+ pivot /= 2;
+ }
+
+ return (biggest == -1) ? smallest : biggest;
+}
+
+int main() {
+ int numbers1[7] = { 5, 6, 7, 9, 10, 12, 13 };
+ cout << smallestRemovedNumber(numbers1, 7) << " " << biggestRemovedNumber(numbers1, 7) << endl;
+
+ int numbers2[5] = { 10, 12, 13, 14, 16 };
+ cout << smallestRemovedNumber(numbers2, 5) << " " << biggestRemovedNumber(numbers2, 5) << endl;
+}