Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*Assignment 4
- Sasi Vazik- 203960570
- vazik@post.bgu.ac.il*/
- #include<stdio.h>
- #include<string.h>
- #include<math.h>
- //Prototypes:
- int Ackerman(int, int);
- void Permutations(int);
- void Partitions(int);
- void main(){
- int i, choice, ackX, ackY, perm, part;
- int numbers[30];
- do{
- printf("Choose one of the following problems or exit:\n[1] -Run Ackerman function.\n[2] - run Permutations problem.\n[3] - Run Partitions problem.\n[4] - Run Knapsack problem.\n[5] - Exit.\nEnter your choice:\n");
- scanf("%d", &choice);
- }
- while(choice<0 || choice >5);
- switch(choice){
- case 1:
- do{
- printf("Enter parameters X and Y for Ackerman function:\n");
- scanf("%d", &ackX);
- printf("\n");
- scanf("%d", &ackY);
- if(ackX<0 || ackY<0)
- printf("Input Incorrect! X and Y should be more or equal to 0. Please try again.\n");
- }
- while(ackX<0 || ackY<0);
- printf("Ack(%d,%d)=%d", ackX, ackY, Ackerman(ackX, ackY));
- break;
- case 2:
- do{
- printf("Enter positive integer greater than 0:\n");
- scanf("%d", &perm);
- if(perm<=0)
- printf("Input Incorrect! Please try again.\n");
- }
- while(perm<=0);
- for(i=0; i<perm; i++)
- numbers[i]=i+1;
- printf("All permutations of numbers (");
- for(i=0; i<perm; i++)
- printf("%d ", numbers[i]);
- printf("):\n");
- Permutations(perm);
- break;
- case 3:
- do{
- printf("Enter positive integer greater than 0:\n");
- scanf("%d", &part);
- if(part<=0)
- printf("Input Incorrect! Please try again.\n");
- }
- while(part<=0);
- printf("All partitions of %d", part);
- Partitions(part);
- break;
- case 4:
- //sdfjg;lsjd;lf;sjdfgj;sdjfgksdfnmvpnsdnvsoifdnvoisrejgoiesgklhjldsfkg;lshdflkhglkjshfdglkjhsdkjfnviusn
- break;
- case 5:
- break;
- }
- main();
- }
Add Comment
Please, Sign In to add comment