Algorithm and code planning

[cppf4life]

Hello, I am currently trying to write some code based on finding roots with Extended Horner and Bairstow's Method.

To be honest, I am totally lost and don't really have a clue how to proceed.

https://imgur.com/a/h8ijpah

I have posted a link to the route diagram the program is supposed to be built around. Any suggestions and pointers are greatly appreciated.

I have a function for the matrix scanner, so that part is okay, but the following portion is where i am lost.

[lastchance]

Well, you were actually given a solution in your previous thread
http://www.cplusplus.com/forum/beginner/278185/#msg1200902

It just has different names for variables, that's all (because it was coded from the Wikipedia explanation).

[cppf4life]

Yes, I see.

I just can't quite figure out to get the calculations based of a user chosen p and q value (u and v, based on wiki).

[jonnin]

does literally just replacing the equation for u and v with cin statements not give you what you are asking? (if not, explain why not?). (line 77 of the provided code)