Search & Sort

// linear search
for (int i = 0; i < N; i++)
        if (arr[i] == x)
            return i;
    return -1;

// bubble sort
for(i = 0; i < n; i++)
    {
        for(j = 0; j < n-i-1; j++)
        {
            if( arr[j] > arr[j+1])
            {
                // swap the elements
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;

// Selection Sort
for (i = 0; i < n - 1; i++)
{
        min_idx = i;
        for (j = i + 1; j < n; j++)
          {
            if (arr[j] < arr[min_idx])
                min_idx = j;
        }
        if (min_idx != i)
            swap(arr[min_idx], arr[i]);
    }
}

// Insertion sort
for (i = 1; i < n; i++) {
        key = arr[i];
        j = i - 1;

        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}

// Binary search
while (low <= high) {
    int mid = low + (high - low) / 2;

    if (array[mid] == x)
      return mid;
    if (array[mid] < x)
      low = mid + 1;
    else
      high = mid - 1;
  }