Add files via upload

Author: coderpheonix

Bubble sort.cpp

@@ -0,0 +1,55 @@
+#include<iostream>
+
+using namespace std;
+
+
+int main ()
+
+{
+    int array[15],i, j, n;
+
+    cout<<"input the size of array : ";
+    cin>>n;
+
+    // for getting the input form the user
+    cout<<"Input the unsorted element : ";
+     for (i=0;i<n;i++)
+     {
+         cin>> array[i];
+     }
+
+    // for printing the given value
+
+    cout<<"The given unsorted element is : ";
+     for (i=0;i<n;i++)
+     {
+         cout<< array[i]<< " ";
+     }
+     cout<<endl;
+// for sorting the element
+
+for (i=0;i<n;i++)
+{
+    for( int j=i+1;j<n;j++)
+    {
+        if(array[i]>array[j])
+        {
+           int tem=array[i];
+            array[i]=array[j];
+            array[j]=tem;
+        }
+    }
+}
+
+// FOR PRINTING THE SORTED ELEMENTS
+cout<<"The sorted element Is : ";
+
+for(i=0;i<n;i++)
+{
+    cout<<array[i]<<" ";
+}
+
+
+
+    return 0;
+}

insertion sort 1.cpp

@@ -0,0 +1,43 @@
+#include<iostream>
+using namespace std;
+
+int i , array[5]={3,8,6,77,9}, n=5;
+
+void InsertionSort ()
+{
+    for(i=1;i<n;i++)
+    {
+        int key=array[i];
+        int j=i-i;
+
+         while (j >= 0 && array[j] > key)
+        {
+            array[j+1]=array[j];
+            j--;
+        }
+        array[j+i]=key;
+    }
+}
+
+
+void print()
+{
+    for(i=0;i<n;i++)
+    {
+        cout<<array[i]<<endl;
+    }
+}
+
+
+
+int main ()
+{
+    cout<<"Before sorted: "<<endl;
+    print();
+    InsertionSort();
+    cout<<"After sorted: "<<endl;
+    print();
+    return 0;
+
+
+}

linier search in array.cpp

@@ -0,0 +1,53 @@
+
+
+#include<iostream>
+
+using namespace std;
+
+
+int main ()
+
+
+{
+    int array[10], i, x,n;
+
+    cout<<"Input the size of array : ";
+    cin>> n;
+    cout<<"Input the element of the array :" ;
+
+    for(i=0;i<n;i++)
+    {
+    cin>>array[i];
+    }
+    // print the given in put
+
+    for (i=0;i<n;i++)
+    {
+        cout<<array[i]<<endl;
+    }
+
+
+    // for search a value_type
+
+    cout<<"Input a value you want to search:"<<endl;
+    cin>> x;
+
+
+    for (i=0;i<n;i++)
+    {
+        if(array[i]==x)
+        {
+            cout<<"The value is found at the index : " <<i;
+
+            break;
+        }
+        else
+        {
+           cout<<"The value is not found in the array"<<endl;
+        break;
+        }
+    }
+
+
+    return 0;
+}

mergesort.cpp

@@ -0,0 +1,82 @@
+#include <iostream>  // Include the input-output stream header
+
+using namespace std; // Use the standard namespace
+
+// Function to merge two subarrays of arr[].
+// First subarray is arr[left..mid]
+// Second subarray is arr[mid+1..right]
+void merge(int arr[], int left, int mid, int right) {
+    int n1 = mid - left + 1;  // Calculate the size of the first subarray
+    int n2 = right - mid;     // Calculate the size of the second subarray
+
+    int L[n1], R[n2];         // Create temporary arrays for the two subarrays
+
+    // Copy data to temporary array L[] from the left subarray
+    for (int i = 0; i < n1; i++)
+        L[i] = arr[left + i];
+
+    // Copy data to temporary array R[] from the right subarray
+    for (int j = 0; j < n2; j++)
+        R[j] = arr[mid + 1 + j];
+
+    // Initial indexes for the left (i), right (j) subarrays and merged subarray (k)
+    int i = 0, j = 0, k = left;
+
+    // Merge the temporary arrays back into arr[left..right]
+    while (i < n1 && j < n2) {  // Continue while there are elements in both subarrays
+        if (L[i] <= R[j]) {     // If the current element of L[] is smaller or equal to R[]
+            arr[k] = L[i];      // Place L[i] into the merged array
+            i++;                // Move to the next element in L[]
+        } else {
+            arr[k] = R[j];      // Place R[j] into the merged array
+            j++;                // Move to the next element in R[]
+        }
+        k++;                    // Move to the next position in the merged array
+    }
+
+    // Copy any remaining elements of L[] into arr[], if any
+    while (i < n1) {
+        arr[k] = L[i];
+        i++;
+        k++;
+    }
+
+    // Copy any remaining elements of R[] into arr[], if any
+    while (j < n2) {
+        arr[k] = R[j];
+        j++;
+        k++;
+    }
+}
+
+// Function to implement Merge Sort on arr[] from index 'left' to 'right'
+void mergeSort(int arr[], int left, int right) {
+    if (left < right) {  // Check if the array has more than one element
+        int mid = (left +right) / 2;  // Calculate the middle point to split the array
+
+        // Recursively sort the first half
+        mergeSort(arr, left, mid);
+
+        // Recursively sort the second half
+        mergeSort(arr, mid + 1, right);
+
+        // Merge the two sorted halves
+        merge(arr, left, mid, right);
+    }
+}
+
+int main() {
+    int arr[] = {38, 27, 43, 3, 9, 82,81, 10};  // Initialize the array to be sorted
+    int arr_size = sizeof(arr) / sizeof(arr[0]);  // Calculate the number of elements in the array
+
+    mergeSort(arr, 0, arr_size - 1);  // Call mergeSort on the entire array
+
+    // Output the sorted array
+    cout << "Sorted array: ";
+    for (int i = 0; i < arr_size; i++)  // Iterate through the sorted array
+        cout << arr[i] << " ";  // Print each element followed by a space
+    cout << endl;  // Print a newline at the end
+
+    return 0;  // Return 0 to indicate successful execution
+}
+

selection sort.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+using namespace std;
+
+void selectionSort(int arr[], int n) {
+    int i, j, minIndex;
+
+    // One by one move the boundary of the unsorted subarray
+    for (i = 0; i < n-1; i++) {
+        // Find the minimum element in the unsorted array
+        minIndex = i;
+        for (j = i+1; j < n; j++) {
+            if (arr[j] < arr[minIndex]) {
+                minIndex = j;
+            }
+        }
+
+        // Swap the found minimum element with the first element
+        int temp = arr[minIndex];
+        arr[minIndex] = arr[i];
+        arr[i] = temp;
+    }
+}
+
+// Function to print the array
+void printArray(int arr[], int ) {
+    for (int i = 0; i <n; i++) {
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+}
+
+int main() {
+    int arr[] = {64, 25, 12, 22, 11};
+    int n = sizeof(arr)/sizeof(arr[0]);
+
+    cout << "Unsorted array: \n";
+    printArray(arr, n);
+
+    selectionSort(arr, n);
+
+    cout << "Sorted array: \n";
+    printArray(arr, n);
+
+    return 0;
+}
+