一道计算一元二次方程解的算法题

今天在群里有人求助一道求解一元二次方程的题目。尝试着写了一下，发现还挺容易犯错了。调试了几次总算OK了

题目如下

解法如下：

#include <iostream>

double processData(double x, double *a, double*b, int count);
//calc the formula
//f(x)=a[0]* x^0 + a[1] * x^1 + ... + a[n] * x^n = 0
double calcFormula(double *a, int count)
{
	if (count <= 0) return 0;
	//calc the f`(x)
	double * b = new double[count + 1];
	for (int i = 0; i <= count; ++i)
		b[i] = a[i] * i;

	double orgX = 0;
	doubl