Generate All Possible Subarrays of a Sequence using C++

#include <bits/stdc++.h>

using namespace std;

void GenerateSubarrays(int arr[], int start, int end, vector<int>& vec, int n) {
    if (end == n) {
        return;
    } else if (start > end) {
        GenerateSubarrays(arr, 0, end + 1, vec, n);
    } else {
        for (int i = start; i <= end; i++) {
            vec.push_back(arr[i]);
        }
        GenerateSubarrays(arr, start + 1, end, vec, n);
    }
    return;
}

int main() {
    int n = 3;
    int arr[] = {1, 2, 3};
    vector<int> vec;
    GenerateSubarrays(arr, 0, 0, vec, n);
    for (int i = 0; i < (int) vec.size(); i++) {
        cout << vec[i] << " ";
    }
    cout << '\n';
    return 0;
}