Search:

set hold to true
for each index i
set a = A[i]
set b = B[i]
set hold to false
for each index j
if A[j] is b
if B[j] is a
set hold to true
break

I've modified it a bit but it wants me to create pointers to the objects a[i] and b[i] I don't know why.



void reflexive(int a[], int sizeOfA, int b[], int sizeOfB)
{
bool hold = true;...

Ok, thank you for being patient with me walla. I believe this is close. I should be getting reflexive for sets 1 and 3. Although, it gave me reflexive for all of them which I know is wrong. Is one...

My new reflexive function :


void reflexive(int a[], int sizeOfA, int b[], int sizeOfB)
{
bool hold = true;

for(i = 0; i < sizeOfA && hold; ++i )
{
for( int...

@walla - changing it to b[j]==a[i] still comes back false. So implement it by saying if (a,b) and (b,c), look for (a,c)? Can you give pseudo code of what you mean? Thanks.

@ bradzk - For my transitive function, your saying to use 3 for loops and pointers? Also, what is M? Your telling to use i,j,k. Also, what do you mean i != i for all i in my reflexive function?

@walla- are you stating my reflexive does not work properly? Also, can you help me in the right direction for determining the transitive function? Thanks.

I have got all of them but transitive now... I do not know how to include c in my functions. &nbsp;Transitive means: If aRb and bRc, then aRc. Here is my reflexive function... How can I change them...

I am having trouble finding out how to code this. I understand what each one is and know how to tell by looking but cannot figure out how to create functions to check whether it is either reflexive,...

The program runs and everything but for values in the list more than 100 it segment faults... The purpose of this program is to run Insertionsort only if the list size is less than the threshold; for...