From 55fc7eb3bba83f4084b2f897c61d0280a5f9c097 Mon Sep 17 00:00:00 2001
From: angeld55 <angel_dimitriev@abv.bg>
Date: Sat, 2 Oct 2021 17:44:35 +0300
Subject: new

---
 Sem. 15/task3.cpp | 53 -----------------------------------------------------
 1 file changed, 53 deletions(-)
 delete mode 100644 Sem. 15/task3.cpp

(limited to 'Sem. 15/task3.cpp')

diff --git a/Sem. 15/task3.cpp b/Sem. 15/task3.cpp
deleted file mode 100644
index b03b844..0000000
--- a/Sem. 15/task3.cpp	
+++ /dev/null
@@ -1,53 +0,0 @@
-#include <iostream>
-using namespace std;
-
-
-//1-ви начин - конкатенираме двата масива и прилагаме сортировка.
-//Губим предимството, че двата масива са били сортирани!
-
-//2-ри начин - с функцията merge. 
-void merge(const int* arr1, int len1, const int* arr2, int len2,  int* result)
-{
-	int ind1 = 0, ind2 = 0, resultIndex;
-
-	while (ind1 < len1 && ind2 < len2)
-	{
-		if (arr1[ind1] <= arr2[ind2])
-			result[resultIndex++] = arr1[ind1++];
-		else
-			result[resultIndex++] = arr2[ind2++];
-	}
-
-	while (ind1 < len1)//Ако е приключил първо вторият масив
-		result[resultIndex++] = arr1[ind1++];
-
-	while (ind2 < len2)//Ако е приключил първо първият масив
-		result[resultIndex++] = arr1[ind2++];
-
-}
-int main()
-{
-	int len1, len2;
-	cin >> len1 >> len2;
-
-	int* arr1 = new int[len1]; // (*)
-	int* arr2 = new int[len2]; // (**)
-	cout << "Enter SORTED array 1:" << endl;
-
-	for (int i = 0; i < len1; i++)
-		cin >> arr1[i];
-
-	cout << "Enter SORTED array 2:" << endl;
-
-	for (int i = 0; i < len2; i++)
-		cin >> arr2[i];
-
-	int* result = new int[len1 + len2]; // (***)
-
-	merge(arr1, len1, arr2, len2, result);
-
-	for (int i = 0; i < len1 + len2; i++)
-		cout << result[i] << " ";
-
-	delete[] arr1, arr2, result; // (*) (**) (***)
-}
-- 
cgit v1.3.1-23-gd82d