Consider the following code snippet: public static void sort(int[] a) for (int i 1; i < a.length; i++) int next = a[i]; int j = i; while (j > o && a[j - 1] > next) a[j] = a[j - 1]; j--; %3D a[j] = next; } What sort algorithm is used in this code? O quicksort insertion sort merge sort O selection sort

#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) {     for (int i = 0; i < n - 1; i++) {         for (int j = 0; j < n - i - 1; j++) {             if (arr[j] > arr[j + 1]) {                 int temp = arr[j];                 arr[j] = arr[j + 1];                 arr[j + 1] = temp;             }         }     } } int binarySearch(int arr[], int l, int r, int x, int& comp) {     comp++;     if (r >= l) {         int mid = l + (r - l) / 2;         if (arr[mid] == x) {             return mid;         }         if (arr[mid] > x) {             return binarySearch(arr, l, mid - 1, x, comp);         }         return binarySearch(arr, mid + 1, r, x, comp);     }     return -1; } int main() {     int Num[8192];     srand(time(NULL));     for (int i = 0; i < 8192; i++) {         Num[i] = rand() % 10001;     }         clock_t starting_time = clock();     bubbleSort(Num, 8192);     clock_t ending_time = clock();     clock_t result =…

bool isprime(long n) /* fixed from to https://www.geeksforgeeks.org/euclid-euler-theorem/?ref=lbp */{    // check whether a number is prime or not    int i;    for (i = 2; i * i <= n; i++)        if (n % i == 0)            return false;    return true;}

int[] cars = {1,2,3,4,5}; for (int i=0; i

Given the Array declaration below, determine the output: int T[8] = {2, 3, 7, 9, -1, 2, 4, 5};   int x = 5;  cout << T[x-2] / T[12-2*x];    int y = -3; cout << pow(T[y+4],T[3-y]);