₦airaland Forum

More painful news is when the new charges against the IPOB leader, Mazi Nnamdi Kanu is squashed in court. Their frustration is continually increased. Mind you the bail application verdict has been shifted to June for specific reasons. Let's wait and see.

From my observation, the FG have continued to get consistent setbacks in their pursuit to attack IPOB. Hence, they have deployed petty tactics to give themselves a sense of success.

Just few weeks ago, Lai Mohammed expressed his displeasure that Facebook was not doing enough to tackle IPOB. From the tune of his speech, there was shear frustration and pain.

In order to put IPOB in bad light, there is a substantial ploy to smear IPOB's name. Consistently, certain known media have been deployed to blame IPOB for any act of violence that is carried out within the southeast even without any investigation in order to achieve two objectives:
1. Make IPOB the people's enemy (which isn't working anyway) by 'clashing' them with the rest of the population and make people hate IPOB and consequently not support them.
2. Produce as much damaging news such as "IPOB butchers Fatima and children" so that once anyone searches IPOB on google, these negative stories are the main results of the search.
These tactics have so far continued to produce barren results.

Again, they continue to post how their security forces invade ESN camp and arrest trained militia members. Most a times when those news articles are shown, two suspects with locally made guns are paraded with their shanty sheds being destroyed. Most times I wonder, do just two person make up an ESN camp? Moreover, the said suspects never confessed to be members of IPOB or ESN.


INDEED, THERE'S MORE TO THIS THAN MEETS THE EYE WHEN NEGATIVE NEWS OF IPOB MAKE HEADLINES.

Skyview01:
How the hell was the dude planning to go to win an election in Nigeria considering the current climate in Nigeria.
I believe POB to be a smart man and to stop wasting his time and resources.

Skewed, right?!

FERNANDEZISBACK:
In conclusion..the British government put a rope around his neck and forced him to drop his ambition..great..now go get some rest..you are overthinking yaself..

Read my last post, above this comment.

cocolacec:
Guess UK threatened Obi to resign or else they will jail like it was done to his Father,Nnamdi Azikwe.

You never know. He might have been asked to withdraw as they are in support of someone else, and probably shouldn't waste any more time in contesting.

I wouldn't be surprised if Peter Obi abandons the whole idea of running entirely.

FERNANDEZISBACK:
21st century and some gullible Africans are still blaming the white for their misfortune.. wonderful..so cos he visited downing street they automatically pressurized him to drop his ambition..? wonderful..just wonderful..

You sound unintelligent with ya analysis.. when will ya stop putting all the blame on whites huh?
Blackeee..

If a few cabals determine the direction of governance in your state, how much Britian with its boogey manipulations in Africa?

Case in point, major monetary policies currently implemented by central banks in Africa (Nigeria's inclusive) are instigated by IMF / Worldbank.

A lot of things are influenced by foreign powers. By the way, I am against blaming the 'white man' for my problems. I blame Africans that submit themselves to be used as willing tools.

In the quest to install another "clueless" African Leader, they have pressurized him to make this decision.

Let it be known that he took this decision after his visitation to 10 Downing Street.

I posted about UK's participation in forcing Peter Obi to resign from the presidential contest here:

https://www.nairaland.com/7145117/hand-uk-peter-obis-resignation/

All of a sudden, the thread is locked (as it is viewed by that Mod as a duplicate thread). This is far from what I put out for discussion. I wonder why certain people continue to be _mindless in their activities.

dheilaw1:
1. This is a good news for all Twiterians (Home and Abroad).
2. He will contest on APGA ticket.
3. He will win in Anambra
4. He will become the first democratically elected president of Biafra. (Land of the Rising Sub)


All hail the incoming president!!!!!!!!!

~abj 2022

Yolomba, when will you guys change?

Kyase:
This one na lamentation oooo

No, far from it. More like, "I told you so"

[quote author=Nigerialabalaba post=113170063][/quote]Funny moniker

Too bad that people are wasting their time trying to better a country that is actively working to self-destruction.

uthlaw:
Another excuse!

The hand that holds this "nation" stagnant has been activated.

Peter Obi will not be allowed to lead. Quote me anywhere.

Since Peter Obi went to 10 Downing Street on invitation of the PM, I knew something was fishy.

The hand that is withholding the balkanization as well as the progress of the contraption has risen again, DISCUSS.

Adewale1603:
those HP spectre. but the battery life is like 10 hrs.

Ok, I will look into it.

OneKinGuy:
I don't thing there's any laptop that can give you the battery life you need and for the specs you're looking for, You can't get any thing brand new with that price. So I urge you to do more research on what you want, then maybe post some of the options you've found and ask for recommendations.

May be you can suggest some models so that I can look them up (the specifications).

I need a laptop that the price should not exceed the N300K range and have the following features:

1. Super battery life that can last like a good phone (12 to 16 hours of operation should do)

2. A good RAM (8GB and upgradable)

3. Good graphics and quality.

Your advice is needed!

CoconutMilk:
I think we can do that by first of all separating terms that will be in CAPS.
i.e [color=#770022]
1. notUniqueTerms[] = permutationsResult[] - combinationResult[]

2. notUniqueTerms.lowerCase()
//Convert to lowercase
combinationResult.upperCase()
//Convert combination/unique terms to uppercase

3. finalList[] = combinationResult[]
+ notUniqueTerms[]

If I get what you mean....

Or


Result[] = []

for element in permutationResult[] {
If element exists in combinationResult[]{
element.uppercase();
add element to Result[]
};

};

[/color]

Please, the uppercase/lowercase scenario is not required, I only used it for better explanation.

Kvngfrosh:
Take it to stack overflow

I have taken it there but they are not willing to help. I believe their programmers are a bit arrogant. Well, I don't really blame them, they just feel it's too simple so they won't answer it.

But they don't realize that everyone is not at the same level.

Please, I need a code to print all possible arrangement (permutation) of the combination of an array (of 'k' elements), i.e. the permutation of the result of combination.



For clarity of purpose, let's say the array has the following elements (k=4):


"alpha", "beta", "gamma", "delta".


Then, for the combination, we choose r=3

After which permutation is carried out.


[For better understanding, the result of the combination is put in UPPERCASE, while the unique result of permutation is in lowercase]

The expected result is as follows:

ALPHA BETA GAMMA
alpha gamma beta
beta alpha gamma
beta gamma alpha
gamma alpha beta
gamma beta alpha
ALPHA BETA DELTA
alpha delta beta
beta alpha delta
beta delta alpha
delta alpha beta
delta beta alpha
ALPHA DELTA GAMMA
alpha gamma delta
delta alpha gamma
delta gamma alpha
gamma alpha delta
gamma delta alpha
BETA DELTA GAMMA
beta gamma delta
delta beta gamma
delta gamma beta
gamma beta delta
gamma delta beta

From the result above, all unique PERMUTATON of the COMBINATION for r=3 from the array of k=4 elements is completed.


This is confirmed since 4C3 x 3! = 24 lines of results

On my own I have been able to get separate codes for permutation and combination, but I can only utilize them MANUALLY as I have to keep substituting the elements of the array of the permutation code with results from the combination code.

Please, I need someone to combine the two codes below into one code and let it work to produce results like the example above.

COMBINATION CODE:

/*C++ program to print all combination of size r in an array of size n*/
#include <iostream>
using namespace std;

void combinationUtil(string arr[], string data[],
int start, int end,
int index, int r);

/*The main function that prints all combinations of size r in arr[] of
size n. This function mainly uses combinationUtil()*/
void printCombination(string arr[], int n, int r)
{
/*A temporary array to store all combination one by one*/
string data[r];

/*Print all combination using temporary array 'data[]'*/
combinationUtil(arr, data, 0, n-1, 0, r);
}

/*arr[] ---> Input Array
data[] ---> Temporary array to
store current combination
start & end ---> Starting and
Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(string arr[], string data[],
int start, int end,
int index, int r)
{

if (index == r)
{
for (int j = 0; j < r; j++)
cout << data[j] << " ";
cout << endl;
return;
}

/*replace index with all possible elements. The condition "end-i+1 >= r-index"
makes sure that including one element at index will make a combination
with remaining elements at remaining positions*/
for (int i = start; i <= end &&
end - i + 1 >= r - index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1,
end, index+1, r);
}
}

// Driver code
int main()
{
string arr[] = {"alpha", "beta", "gamma", "delta"};
int r = 3;
int n = sizeof(arr) / sizeof(arr[0]);
printCombination(arr, n, r);
}

PERMUTATION CODE:

#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;

// Function to display the array
void display(string a[], int n)
{
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}

// Function to find the permutations
void findPermutations(string a[], int n)
{
// Sort the given array
sort(a, a + n);

// Find all possible permutations
cout << "Possible permutations are:\n";
do {
display(a, n);
} while (next_permutation(a, a + n));
}

// Driver code
int main()
{
string a[] = { "alpha", "beta", "gamma"};
int n = sizeof(a) / sizeof(a[0]);
findPermutations(a, n);
return 0;
}

PLEASE, I need help!


Cc: hucknall

I know it's a long read, but I appreciate your patience.

Please, I need a code to print all possible arrangement (permutation) of the combination of an array (of 'k' elements), i.e. the permutation of the result of combination.



For clarity of purpose, let's say the array has the following elements (k=4):


"alpha", "beta", "gamma", "delta".


Then, for the combination, we choose r=3

After which permutation is carried out.


[For better understanding, the result of the combination is put in UPPERCASE, while the unique result of permutation is in lowercase]

The expected result is as follows:

ALPHA BETA GAMMA
alpha gamma beta
beta alpha gamma
beta gamma alpha
gamma alpha beta
gamma beta alpha
ALPHA BETA DELTA
alpha delta beta
beta alpha delta
beta delta alpha
delta alpha beta
delta beta alpha
ALPHA DELTA GAMMA
alpha gamma delta
delta alpha gamma
delta gamma alpha
gamma alpha delta
gamma delta alpha
BETA DELTA GAMMA
beta gamma delta
delta beta gamma
delta gamma beta
gamma beta delta
gamma delta beta

From the result above, all unique PERMUTATON of the COMBINATION for r=3 from the array of k=4 elements is completed.


This is confirmed since 4C3 x 3! = 24 lines of results

On my own I have been able to get separate codes for permutation and combination, but I can only utilize them MANUALLY as I have to keep substituting the elements of the array of the permutation code with results from the combination code.

Please, I need someone to combine the two codes below into one code and let it work to produce results like the example above.

COMBINATION CODE:

/*C++ program to print all combination of size r in an array of size n*/
#include <iostream>
using namespace std;

void combinationUtil(string arr[], string data[],
int start, int end,
int index, int r);

/*The main function that prints all combinations of size r in arr[] of
size n. This function mainly uses combinationUtil()*/
void printCombination(string arr[], int n, int r)
{
/*A temporary array to store all combination one by one*/
string data[r];

/*Print all combination using temporary array 'data[]'*/
combinationUtil(arr, data, 0, n-1, 0, r);
}

/*arr[] ---> Input Array
data[] ---> Temporary array to
store current combination
start & end ---> Starting and
Ending indexes in arr[]
index ---> Current index in data[]
r ---> Size of a combination to be printed */
void combinationUtil(string arr[], string data[],
int start, int end,
int index, int r)
{

if (index == r)
{
for (int j = 0; j < r; j++)
cout << data[j] << " ";
cout << endl;
return;
}

/*replace index with all possible elements. The condition "end-i+1 >= r-index"
makes sure that including one element at index will make a combination
with remaining elements at remaining positions*/
for (int i = start; i <= end &&
end - i + 1 >= r - index; i++)
{
data[index] = arr[i];
combinationUtil(arr, data, i+1,
end, index+1, r);
}
}

// Driver code
int main()
{
string arr[] = {"alpha", "beta", "gamma", "delta"};
int r = 3;
int n = sizeof(arr) / sizeof(arr[0]);
printCombination(arr, n, r);
}

PERMUTATION CODE:

#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;

// Function to display the array
void display(string a[], int n)
{
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}

// Function to find the permutations
void findPermutations(string a[], int n)
{
// Sort the given array
sort(a, a + n);

// Find all possible permutations
cout << "Possible permutations are:\n";
do {
display(a, n);
} while (next_permutation(a, a + n));
}

// Driver code
int main()
{
string a[] = { "alpha", "beta", "gamma"};
int n = sizeof(a) / sizeof(a[0]);
findPermutations(a, n);
return 0;
}

PLEASE, I need help!

.

.

.