DKA method

DKA.cc

#include <iostream>
#include <complex>
#include <vector>
#include <iomanip>

using complexd=std::complex<double>;

void showpoly(const std::vector<double> &coeffs);
complexd poly(const std::vector<double> &coeffs,const complexd &z);
void DKA(const std::vector<double> &coeffs,std::vector<complexd> &poles);

double binary(const std::vector<double> &coeffs);

int main(){
  int n;
  std::cout<<"degree:";
  std::cin>>n;
  std::vector<double> coeffs(n);

  for(auto &c:coeffs)
    std::cin>>c;
  
  showpoly(coeffs);
  std::cout<<"=0"<<std::endl;
  
  
  return 0;
}

void showpoly(const std::vector<double> &coeffs){
  int n = coeffs.size();
  std::cout<<"x^"<<n;
  for(int i=0;i<n;i++){
    std::cout<<std::showpos<<coeffs[i]<<"x^"<<std::noshowpos<<n-i-1;
  }
}

complexd poly(const std::vector<double> &coeffs,complexd &z){
  complexd q=0;
}

void DKA(const std::vector<double> &coeffs,std::vector<complexd> &poles){
  int n=coeffs.size();
  std::vector<complexd> tmppoles(n);
  double r = binary(coeffs);
  for(int i=0;i<n;++i){
    // tmppoles[i] = -coeffs[i]/n + r*std::exp(
  }

  //iteration
}

double binary(const std::vector<double> &coeffs){

}