Programmer builds algorithm to help Yeddyurappa determine when to stop getting expelled from parties

Follow @TheUnRealTimes

Srikant’s algorithm will complement Yeddy’s impulsiveness very well

Former Karnataka Chief Minister BS Yeddyurappa was expelled yesterday from the Karnataka Janata Party, a party he had helped re-launch along with founder Padmanabha Prasanna, when he quit the Bharatiya Janata Party (BJP). As with the breakup with BJP, Yeddyurappa is expected to encourage a certain fraction of legislators to come along with him this time as well.

While it is not clear what Yeddyurappa’s immediate course of action would be – there are murmurs that he may start his own party this time around – political scientists believe that an important question is beginning to loom in front of Yeddyurappa: “How many breakups can Yeddyurappa successfully undergo before he’s left with a one-man party, i.e. himself?”

Help has come forth from a young resident of Shikaripura, Yeddyurappa’s home constituency. Srikant Bangarappa, a software engineer currently working with Bangalore based software giant, Infosys, has developed an algorithm that will provide the answer to this very question.

“Given all that Mr. Yeddyurappa has done for Karnataka as the Chief Minister, this is the least I could do for him,” sniggered Srikant. “I have placed a basic algorithm in the public domain for use by him and other rebel leaders across the country using which they can make calculated decisions that will protect their political careers. Should leaders need additional customization, they may hire my services for a nominal fee.”

The algorithm has already generated a lot of interest across the political space. A representative from JD(U) has written to Srikant asking if he could modify the algorithm to model break-ups from alliances as against parties. Representatives from Samajwadi party and BSP have made similar requests, but asked to add the additional input parameter ‘CBI’ in the function.

Meanwhile, Srikant’s basic algorithm is already in the public domain, and has been duly reproduced here. The recursive function takes two parameters – the total legislators associated with the current party, and the estimated percentage of faction of legislators loyal to the rebel leader, and returns the total number of breakups the rebel may risk before being left all alone.

int HowManyBreakUps(int TotalLegislators, float LoyalFactionPercentage) // Function
{

int NumberOfLegislatorsYeddyCanTakeAlong = TotalLegislators * LoyalFactionPercentage;

if (NumberOfLegislatorsYeddyCanTakeAlong >= 1)
return (1 + HowManyBreakUps(NumberofLegislatorsYeddyCanTakeAlong, LoyalFactionPercentage));
else
return (0);
}

Related posts:

1. Mapping key Indian politicians, parties to computer keyboard functions: A beginner’s guide
2. Petraeus scandal: Pakistan tells US to stop screwing around, get serious about war against terror
3. Picture Series: BS Yeddyurappa explores political alternatives after severing ties with BJP
4. Parties demand reservation in KBC; want special session of Parliament to pass bill
5. Apple customizes iPads to suit the needs of political parties