ok maybe am going nuts and this is stupid but here is my question. but first take a look at the following
1)

for(int i = 1; i <= 4; i++) //this gives 1,2,3,4
{
}
 
2)for(int = 1 ; i <= 3; i++)// this gives (1,2) (1,3) (1,4) (2,3) (2,4) (3,4) 
 {
    for(int j = i + 1; j <= 4; i++)
   {

   }
 }

i want to generate numbers in this pattern for when N = 1 or 2 or 3 or 4. generating all possible subsets where N = number of elements in an array. in this case i used N = 4.
1, 2 ,3 ,4
(1,2) (1,3) (1,4) (2,3) (2,4) (3,4)
(1,2,3) (1,2,4) (1,3,4) (2,3,4)
now when N is 5 or 6 or 7 or 8
how do i write a generalized loop that can sense the number of elements and come up with the subsets.
Now i have been on this matter for days now and have seen solutions using recursion but i don't want to use the recursion solution looking at the code above you see that for each situation the single numbers need a "single" for loop while the pair of numbers need "two" for loops.
my real question is "Is there a way to merge loops 1 and 2 above in a generalized manner or so so that if am writing another program and i say generate just single numbers in the array of say N elements, the program knows to use a single loop and if i say from this set of numbers in the array give me all possible combination of two numbers, the program knows it needs two loops that are nested and so on?
any ideas
programming is sweet hallelujah

was finally able to figure out and solve the problem.
cheers.

mexzony:
was finally able to figure out and solve the problem.
cheers.

oya share the testimony how u solve it.

i hope u don't want me to preach on the benefits of giving testimonies

romme2u:


oya share the testimony how u solve it.

i hope u don't want me to preach on the benefits of giving testimonies

I actually ditched the approach above as it was a time waster and went back to my earlier apporaoch where I use binary representation of each subset.
Basically for N = 4 we will have 2^4 subsets which equals 16 subsets. Summarising with tables here is the trick
Say we have 4 elements and we call each 1 2 3 4
Then
1 2 3 4
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1

This goes all the way from 0 to (2^4 - 1) and u see the binary representstion of each number.
For every position there is a 1 called a bit there is a subset so for 1 we have the subset {4} for 2 we have {3}
For 3 we have {3,4}. This goes on like that.
I like to be a little bit adventurous that's why I was trying to come up with so many solutions from different angles a times I just stress my self but its all part of the fun .

mexzony:


I actually ditched the approach above as it was a time waster and went back to my earlier appraoch where I use binary representation of each subset.
Basically for N = 4 we will have 2^4 subsets which equals 16 subsets. Summarising with tables here is the trick
Say we have 4 elements and we call each 1 2 3 4
Then
1 2 3 4
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1

This goes all the way from 0 to (2^4 - 1) and u see the binary representation of each number.
For every position there is a 1 called a bit there is a subset so for 1 we have the subset {4} for 2 we have {3}
For 3 we have {3,4}. This goes on like that.
I like to be a little bit adventurous that's why I was trying to come up with so many solutions from different angles a times I just stress my self but its all part of the fun .

this is more mathematical than logical. can u deduce the concept into a mathematical formula (possibly with pseudo-code) as the explanation is flying above my head. thanks

Can anyone generate a programming code such that any number you enter above 65 prints out alphabets that leave a blank space in the middle in the shape of a diaomond
For example
ABCDEFGFEDCBA
ABCDEFOFEDCBA
ABCDEOOOEDCBA
ABCDOOOOODCBA
ABCOOOOOOOCBA
ABOOOOOOOOOBA
AOOOOOOOOOOOA
ABOOOOOOOOOBA
ABCOOOOOOOCBA
ABCDOOOOODCBA
ABCDEOOOEDCBA
ABCDEFOFEDCBA
ABCDEFGFEDCBA
Meanwhile this code should be applicable to a higher number of consecutive alphabets beginning for from A
The O's are just there to fill the spaces inorder for the patern to be printed in order

romme2u:


this is more mathematical than logical. can u deduce the concept into a mathematical formula (possibly with pseudo-code) as the explanation is flying above my head. thanks

Hello you should Google power set.you will have a better understanding.
I can send you the code later but I would want you to try it out on your own.
Also hope you know bitwise operators and how they work.

mexzony:
ok maybe am going nuts and this is stupid but here is my question. but first take a look at the following
1)

for(int i = 1; i <= 4; i++) //this gives 1,2,3,4
{
}
 
2)for(int = 1 ; i <= 3; i++)
 {
    for(int j = i + 1; j <= 4; i++)
   {

   }
 }

i want to generate numbers in this pattern for when N = 1 or 2 or 3 or 4. generating all possible subsets where N = number of elements in an array. in this case i used N = 4.
1, 2 ,3 ,4
(1,2) (1,3) (1,4) (2,3) (2,4) (3,4)
(1,2,3) (1,2,4) (1,3,4) (2,3,4)
now when N is 5 or 6 or 7 or 8
how do i write a generalized loop that can sense the number of elements and come up with the subsets.
Now i have been on this matter for days now and have seen solutions using recursion but i don't want to use the recursion solution looking at the code above you see that for each situation the single numbers need a "single" for loop while the pair of numbers need "two" for loops.
my real question is "Is there a way to merge loops 1 and 2 above in a generalized manner or so so that if am writing another program and i say generate just single numbers in the array of say N elements, the program knows to use a single loop and if i say from this set of numbers in the array give me all possible combination of two numbers, the program knows it needs two loops that are nested and so on?
any ideas
programming is sweet hallelujah

There you are bro.
You only need to enter the limit of the combination you want, as indicated, say 4,5,6,7,8........
If you need a logical explaination, incase u do not understand inform me, but try ot study it first.
Meanwhile let me give an assignment bro. Write a code that will tell u if a number is prime or not.by uisng loops not functions.
ALL THE BEST
#include<stdio.h>
int main()
{
int i,j,k;
printf("ENTER LIMIT OF COMBINATION";
scanf("%d",&k);

for(int i = 1 ; i <= k-1; i++)// this gives (1,2) (1,3) (1,4) (2,3) (2,4) (3,4)
{
for(int j = i + 1; j <= k; j++)
{
printf("%d",i);
printf("%d",j);
printf("\n";
}
}
}

benji93:



There you are bro.
You only need to enter the limit of the combination you want, as indicated, say 4,5,6,7,8........
If you need a logical explaination, incase u do not understand inform me, but try ot study it first.
Meanwhile let me give an assignment bro. Write a code that will tell u if a number is prime or not.by uisng loops not functions.
ALL THE BEST
#include<stdio.h>
int main()
{
int i,j,k;
printf("ENTER LIMIT OF COMBINATION";
scanf("%d",&k);

for(int i = 1 ; i <= k-1; i++)// this gives (1,2) (1,3) (1,4) (2,3) (2,4) (3,4)
{
for(int j = i + 1; j <= k; j++)
{
printf("%d",i);
printf("%d",j);
printf("\n";
}
}
}

Thanks will study the code.
As for the prime number. Have solved it before a long time ago.

Enter  a  positive  number: enter number here
 int leastDivisor =  2;
Int  maxDivisor = √positive number;
bool IsPrime  = true;
while (IsPrime  &&  (leastdivisor  <=  maxDivisor)
{
     if (number %  leastDivisor  ==  0)
     { 
         IsPrime = false;
      }
      leastDivisor++;
}
Print out if number is prime or not;

mexzony:

Thanks will study the code.
As for the prime number. Have solved it before a long time ago.

Enter  a  positive  number: enter number here
 int leastDivisor =  2;
Int  maxDivisor = √positive number;
bool IsPrime  = true;
while (IsPrime  &&  (leastdivisor  <=  maxDivisor)
{
     if (number %  leastDivisor  ==  0)
     { 
         IsPrime = false;
      }
      leastDivisor++;
}
Print out if number is prime or not;

I previously thought you were discusisng c programming languages, cos ur code is just not clear.

benji93:

I previously thought you were discusisng c programming languages, cos ur code is just not clear.

Oh sorry I am writing in code/pseudocode
Am using c# but the whole concept should be understandable.

mexzony:

Thanks will study the code.
As for the prime number. Have solved it before a long time ago.

Enter  a  positive  number: enter number here
 int leastDivisor =  2;
Int  maxDivisor = √positive number;
bool IsPrime  = true;
while (IsPrime  &&  (leastdivisor  <=  maxDivisor)
{
     if (number %  leastDivisor  ==  0)
     { 
         IsPrime = false;
      }
      leastDivisor++;
}
Print out if number is prime or not;

yep the logic correct. Have you tried the other code proble i posted.About the diamond shape.Using alphabets

benji93:

yep the logic correct. Have you tried the other code proble i posted.About the diamond shape.Using alphabets

Not yet a bit occupied.will do so for sure.