itsanshulverma / du-cs-undergrad-course

Companion repo to store codes, assignments for B.Sc. (Hons) Computer Science Course (2019-2022) by University of Delhi

hi there👋, I am Anshul Verma

👨‍💻 A coder/programmer/developer who likes JavaScript a lot.

👨‍🎓 Currently pursuing MBA from Indian Institute of Management, Lucknow (Class of 2025).
👨‍🎓 Computer Science and Mathematics Graduate from the University of Delhi (Class of 2022).

👉 Website

ask me about 📢

mba, cat, tech, web development, data, mathematics, gadgets, movies or anything new. I would love to connect and learn things.

technologies 👨‍💻

|languages|

|web|

|

|ml, maths & data science|

|databases|

|apps|

|other tools|

|os|

|mobile development|

|editors/ide|

📈 github stats

du-cs-undergrad-course's Issues

permute

#include

using namespace std;

void swap(int& a, int& b) {
int temp = a;
a = b;
b = temp;
}

void generatePermutations(int* nums, bool* used, int* perm, int size, int index, bool allowRepetition) {
if (index == size) {
for (int i = 0; i < size; i++) {
cout << perm[i] << " ";
}
cout << endl;
return;
}

for (int i = 0; i < size; i++) {
    if (!allowRepetition && i > 0 && nums[i] == nums[i - 1] && !used[i - 1])
        continue;

    if (!used[i]) {
        used[i] = true;
        perm[index] = nums[i];
        generatePermutations(nums, used, perm, size, index + 1, allowRepetition);
        used[i] = false;
    }
}

}

void permute(int* nums, int size, bool allowRepetition) {
bool* used = new bool[size];
int* perm = new int[size];

for (int i = 0; i < size; i++)
    used[i] = false;

generatePermutations(nums, used, perm, size, 0, allowRepetition);

delete[] used;
delete[] perm;

}

int main() {
int size;
cout << "Enter the number of elements: ";
cin >> size;

int* nums = new int[size];
cout << "Enter the elements: ";
for (int i = 0; i < size; i++) {
    cin >> nums[i];
}

bool allowRepetition;
cout << "Allow repetition? (1 for yes, 0 for no): ";
cin >> allowRepetition;

permute(nums, size, allowRepetition);

delete[] nums;

    return 0;
}