Add files via git

Author: naiemofficial

Diff for: Array initializations & operations/.directory

@@ -0,0 +1,6 @@
+[Dolphin]
+HeaderColumnWidths=559,108,138,186
+Timestamp=2022,6,22,3,23,0.424
+Version=4
+ViewMode=1
+VisibleRoles=Details_text,Details_size,Details_modificationtime,Details_type,CustomizedDetails

Diff for: Array initializations & operations/Array Initialization and print.cpp

@@ -0,0 +1,11 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+    int A[5] = {10, 20, 30, 40, 50};
+
+    int arrayLength = sizeof(A)/sizeof(A[0]);
+    for (int i = 0; i < arrayLength; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+}

Diff for: Array initializations & operations/Array Initilization - set values by index.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+    int A[5];
+    A[0] = 10;
+    A[1] = 20;
+    A[2] = 30;
+    A[3] = 40;
+    A[4] = 50;
+
+    int arrayLength = sizeof(A)/sizeof(A[0]);
+    for (int i = 0; i < arrayLength; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+}

Diff for: Array initializations & operations/Create array from user (dynamic memory allocation).cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cout << "Enter the size of array: ";
+    cin >> n;
+
+    int *A = new int [n]; // Memory allocation
+    for (int i = 0; i < n; i++){
+        cout << "Enter the value of index " << i << ": ";
+        cin >> A[i];
+    }
+
+    cout << endl;
+
+    for (int i = 0; i < n; i++){
+        cout << "[" << A[i] << "] ";
+    }
+    delete A; // Memory deallocation
+    
+}

Diff for: Array initializations & operations/Deletion - Sorted array.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+using namespace std;
+
+int deletion(int A[], int size, int position, int value){
+    position = position-1; // convert to index
+    if(position >= 0 && position < size){
+        int prev, next;
+        for (int i = 0; i < size; i++) {
+            if (i >= position && i < size) {
+                A[i] = A[i+1];
+            }
+        }
+        return --size;
+    } else {
+        cout << "Invalid position! The position must be less than or equal to the A length." << endl << endl;
+        return 0;
+    }
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 2, 3, 4, 5};
+    int size = 5;
+    size = deletion(A, size, 3, 9); // Parameters: Array, size, position => the function will return the updated size of arrray
+    print(A, size);
+}

Diff for: Array initializations & operations/Deletion - Unsorted array.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+
+int deletion(int A[], int size, int position){
+    if(position >= 0 && position <= size){
+        A[position-1] = A[size-1];
+        return --size;
+    } else {
+        cout << "Invalid position! The position must be less than or equal to the A length." << endl << endl;
+        return 0;
+    }
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {3, 1, 5, 2, 4};
+    int size = 5;
+    size = deletion(A, size, 3); // Parameters: Array, size, position => the function will return the updated size of arrray
+    print(A, size);
+}

Diff for: Array initializations & operations/Deletion - based on user input.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+using namespace std;
+
+void deletion(){
+    int size, loop, position, value;
+
+    cout << "Enter the size of array: ";
+    cin >> size;
+    int A[size];
+    for( int i = 0; i < size; i++ ){
+        cout << "Enter a value for the position of [" << i+1 << "]: ";
+        cin >> A[i];
+    }
+
+    cout << endl << "Array is => ";
+    for( int i = 0; i < size; i++ ){
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+
+    cout << "How many values do you want to delete from this array?: ";
+    cin >> loop;
+
+    for( int i = 0; i < loop; i++ ){
+        cout << endl << "[Delete-"<<i+1<<"] Enter the Postion: " ;
+        cin >> position;
+        position = position-1;
+        if(position >= 0 && position < size){
+            for( int x = position; x < size-(i+1); x++ ){
+                A[x] = A[x+1];
+            }
+
+            cout << "Array is => ";
+            for(int y = 0; y < size-(i+1); y++){
+                cout << "[" << A[y] << "] ";
+            }
+            cout << endl;
+        }else{
+            cout << "Invalid position! The position must be less than or equal to the A length";
+            break;
+        }
+    }
+}
+
+int main(){
+    deletion();
+}

Diff for: Array initializations & operations/Insertion - Shift from the left.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+using namespace std;
+
+void insertion(int A[], int size, int position, int value){
+    position = position-1; // convert to index
+    if(position >= 0 && position < size){
+        for (int i = 0; i < size; i++) {
+            if (i >= position) {
+                int prev, next;
+                if (i == position) {
+                    prev = A[i];
+                    A[i] = value;
+                } else {
+                    A[i] = prev;
+                    prev = next;
+                }
+                if (i+1 < size) next = A[i+1];
+            }
+        }
+    } else {
+        cout << "Invalid position! The position must be less than or equal to the A length." << endl << endl;
+    }
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 2, 3, 4, 5};
+    insertion(A, 5, 3, 9); // Parameters: Array, size, position, value
+    print(A, 5);
+}

Diff for: Array initializations & operations/Insertion - Shift from the right.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+
+void insertion(int A[], int size, int position, int value){
+    position = position-1; // convert to index
+    if (position >= 0 && position < size) {
+        for( int i=size-1; position < i; i-- ){
+            A[i] = A[i-1];
+        }
+        A[position] = value;
+    } else {
+        cout << "Invalid position! The position must be less than or equal to the A length." << endl << endl;
+    }
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 2, 3, 4, 5};
+    insertion(A, 5, 3, 9); // Parameters: Array, size, position, value
+    print(A, 5);
+}

Diff for: Array initializations & operations/Merge two arrays into one array.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+using namespace std;
+
+int *merge(int A[], int sizeA, int B[], int sizeB){
+    int size = sizeA+sizeB, temp = 0;
+    int *Array = new int[size];
+    for(int i = 0; i < size; i++){
+        Array[i] = (i < sizeA) ? A[i] : B[temp];
+        if(i >= sizeA) temp++;
+    }
+    return Array;
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 3, 5, 7, 9};
+    int B[] = {2, 4, 6, 8, 10};
+
+    int sizeA = sizeof(A)/sizeof(A[0]);
+    int sizeB = sizeof(B)/sizeof(B[0]);
+
+    int *merged = merge(A, sizeA, B, sizeB);
+    print(merged, (sizeA+sizeB));
+}

Diff for: Array initializations & operations/Merge two unsorted arrays into a sorted array.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+using namespace std;
+
+void selectionSort_ASC(int Array[], int size){
+    for(int x = 0; x < size-1; x++){
+        int temp = x;
+        for(int y = x+1; y < size; y++){
+            if(Array[y] < Array[temp]) temp = y;
+        }
+        if(temp != x){
+            int swap = Array[x];
+            Array[x] = Array[temp];
+            Array[temp] = swap;
+        }
+    }
+}
+
+int *merge(int A[], int sizeA, int B[], int sizeB){
+    int size = sizeA+sizeB;
+    int *sort = new int[size];
+    if(sizeA > 0 && sizeB > 0){
+        int i = 0, x = 0, y = 0;
+        while(x < sizeA && y < sizeB){
+            if(A[x] <= B[y]){
+                sort[i++] = A[x++];
+            } else {
+                sort[i++] = B[y++];
+            }
+        }
+        while(x < sizeA){
+            sort[i++] = A[x++];
+        }
+        while(y < sizeB){
+            sort[i++] = B[y++];
+        }
+    } else {
+        cout << "Merge not possible" << endl;
+    }
+    return sort;
+}
+
+void print(int A[], int size){
+    for (int i = 0; i < size; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {4, 3, 10, 8, 7};
+    int B[] = {2, 1, 6, 5, 9};
+
+    int sizeA = sizeof(A)/sizeof(A[0]);
+    int sizeB = sizeof(B)/sizeof(B[0]);
+
+    selectionSort_ASC(A, sizeA);
+    selectionSort_ASC(B, sizeB);
+
+    int *merged = merge(A, sizeA, B, sizeB);
+    print(merged, (sizeA+sizeB));
+}

Diff for: Array initializations & operations/Reverse (Iterative).cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+using namespace std;
+
+void reverse(int A[], int n){
+    if(n > 1){
+        int j = n-1;
+        for(int i = 0; i < j; i++, j--){
+            int swap = A[i];
+            A[i] = A[j];
+            A[j] = swap;
+        }
+    } else {
+        cout << "Array must have more than 1 elements" << endl;
+    }
+}
+
+void print(int A[], int n){
+    for (int i = 0; i < n; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+    int n = sizeof(A)/sizeof(A[0]);
+    reverse(A, n);
+    print(A, n);
+}

Diff for: Array initializations & operations/Reverse (Recursive).cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+using namespace std;
+
+void reverse(int A[], int start, int end){
+    if(start >= end) return;
+    int swap = A[start];
+    A[start] = A[end];
+    A[end] = swap;
+    reverse(A, start+1, end-1); 
+}
+
+void print(int A[], int n){
+    for (int i = 0; i < n; i++) {
+        cout << "[" << A[i] << "] ";
+    }
+    cout << endl;
+}
+
+int main(){
+    int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+    int n = sizeof(A)/sizeof(A[0]);
+    reverse(A, 0, n-1);
+    print(A, n);
+}