Fibonaci Series
Fibonaci Series
Fibonaci Series
int main() {
int n, t1 = 0, t2 = 1, nextTerm = 0;
Output
#include <iostream>
using namespace std;
int main()
{
int n;
cout << "Enter the value of n \n";
cin >> n;
#include <iostream>
using namespace std;
int main()
{
int rows;
#include <iostream>
using namespace std;
int main()
{
int rows;
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int space, rows;
while(k != 2*i-1)
{
cout << "* ";
++k;
}
cout << endl;
}
return 0;
}
int main()
{
int arr[50], size, insert, i, pos;
cout<<"Enter Array Size : ";
cin>>size;
cout<<"Enter array elements : ";
for(i=0; i<size; i++)
{
cin>>arr[i];
}
cout<<"Enter element to be insert : ";
cin>>insert;
cout<<"At which position (Enter index number) ? ";
cin>>pos;
// now create a space at the required position
for(i=size; i>pos; i--)
{
arr[i]=arr[i-1];
}
arr[pos]=insert;
cout<<"Element inserted successfully..!!\n";
cout<<"Now the new array is : \n";
for(i=0; i<size+1; i++)
{
cout<<arr[i]<<" ";
}
getch();
return 0;
}
age
1. kal'ab araya 17
2. amanuel abraha 18
3. mearg abadi 18
4. filmon g.tnsae 18
5. dawit negasi 18
6. Luam berihu 18
7. michael kebede 18
8. novel tesfa'alem 17
9. nardos weldekiros 19
10. yordanos yohannes 20
11. sibagads mulugeta 16
12. naod fitsum 19
13. haysem abdulkadir 17