1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
|
#include "Polynomes.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
Polynome::Polynome()
: m_polynome(0,0)
{}
void Polynome::ecrirePolynome()
{
unsigned short degre;
unsigned short i;
int tmp(0);
do
{
cout << "Entrez le degre du polynome (degre de 1 a 10 seulement)" << endl;
cin >> degre;
}while(degre<1 || degre > 11);/*On bloque le degré entre 0 et 10*/
for(i=0;i<degre+1;i++)
{
cout << "Entrez le coefficient du polynome de degre x^" << i << endl;
cin >> tmp;
m_polynome.push_back(tmp); /*On augmente la taille du tableau jusqu'à la valeur degre*/
}
}
void Polynome::reinitializationPolynome()
{
int i;
for(i=m_polynome.size()-1;i>=0;i--)
{
m_polynome.pop_back(); /**/
}
}
void Polynome::inversionPolynome()
{
unsigned short i,j;
int tmp;
/*Inversion du tableau avec une médiane */
for(i=0,j=m_polynome.size()-1; i<j ;i++,j--)
{
tmp = m_polynome[i];
m_polynome[i] = m_polynome[j];
m_polynome[j] = tmp;
}
}
void Polynome::afficherPolynomeInverser()
{
unsigned short i,j(m_polynome.size()-1);/*Le tableau de polynome est inversé alors on commence par la derniére case pour avoir le degré*/
cout <<"P(x)= ";
if(m_polynome.size()-1==1)
{
if(m_polynome[0] != 1 && m_polynome[0] != -1)cout <<m_polynome[0]<<"x ";
else if(m_polynome[0]==-1)cout <<"-x ";
else cout <<"x ";
if(m_polynome[1]==-1)cout <<"-1 ";
else if(m_polynome[1]==1)cout <<"+ 1 ";
else cout <<"+ "<<m_polynome[1];
}
else
{
for(i=0;i<m_polynome.size();i++)
{
if(i==m_polynome.size()-1) /*Si le degré de x = 0, on affiche juste son multiplicateur*/
{
if(m_polynome[m_polynome.size()-1]!=1 && m_polynome[m_polynome.size()-1]!=-1)
{
if(m_polynome[m_polynome.size()-1]<0) cout <<" "<<m_polynome[i];
else cout <<" + "<<m_polynome[i];
}
else if(m_polynome[m_polynome.size()-1]==1)cout <<" + 1";
else if(m_polynome[m_polynome.size()-1]==-1)cout <<" -1";
}
else if(i==m_polynome.size()-2)/*Si le degré de x = 1, on n'affiche pas la ^1 */
{
if(m_polynome[m_polynome.size()-2]!=1 && m_polynome[m_polynome.size()-2]!=-1)
{
if(m_polynome[m_polynome.size()-2]<0) cout <<" "<<m_polynome[i]<<"x";
else cout <<" + "<<m_polynome[i]<<"x";
}
else if(m_polynome[m_polynome.size()-2]==1)cout <<" + x";
else if(m_polynome[m_polynome.size()-2]==-1)cout <<" -x";
}
else if(i==0)
{
if(m_polynome[0]!=-1 && m_polynome[0]!=1 && m_polynome[0]!=0) cout <<" "<<m_polynome[0]<<"x^"<<j;
else if(m_polynome[0]==1) cout <<" x^"<<j;
else if(m_polynome[0]==-1) cout<<" -x^"<<j;
}
else
{
if(m_polynome[m_polynome.size()-i-1]!=-1 && m_polynome[m_polynome.size()-i]!=1) cout <<" + "<<m_polynome[i]<<"x^"<<j;
else if(m_polynome[m_polynome.size()-i-1]==1) cout <<" + x^"<<j;
else if(m_polynome[m_polynome.size()-i-1]==-1) cout<<" -x^"<<j;
}
j--;
}
}
}
/*cacul de la puissance par récursivité*/
int puissance(int x, int n)
{
int resultat;
if(n == 0)
{
return (resultat=1);
}
return(resultat = x * puissance(x,n-1));
}
int Polynome::calculPolynomePdeX( int x)
{
int resultat(0);
unsigned short i,j;
j=m_polynome.size()-1;
for(i=0;i<m_polynome.size();i++)
{
resultat = resultat + m_polynome[i]*puissance(x,j); /* x étant donné par l'untilisateur. On applique juste la formule P(x) = ...*/
j--;
}
return resultat;
}
Polynome& Polynome::calculDerivee( Polynome p)
{
unsigned short i,j;
j=m_polynome.size()-1;
for(i=0;i<m_polynome.size();i++)
{
p.m_polynome.push_back(0);
p.m_polynome[i]= j * m_polynome[i];
if(i == m_polynome.size()-1)
{
p.m_polynome.pop_back();
}
j--;
}
return p;
}
/*
Polynome& Polynome::calculPrimitive()
{
unsigned short i,j;
j=m_polynome.size()-1;
for(i=0;i<m_polynome.size();i++)
{
m_polynomePrimitive.push_back(0);
m_polynomePrimitive[i]= j * m_polynome[i]/(j+1);
if(i == m_polynome.size()-1)
{
m_polynomePrimitive.pop_back();
}
j--;
}
for(i=0;i<m_polynomePrimitive.size();i++)
{
cout <<m_polynomePrimitive[i];
}
return Polynome p;
}
Polynome& Polynome::calculDerivee()
{
return 0;
} |
Partager