I.

Write program
1. Declare an double array with max 100 elements
2. Input an positive integer n that indicated the number of element of array
3. Input n elements of array
4. Display array has just been inputted
5. Calculate sum of all elements, sum of elements that has odd index, average elements at
index is a prime, average of element at odd index
II. Vit

cc hm thc hin cc yu cu sau

1. Nhp vo kch thc v cc phn t ca mt mng mt chiu
void nhap(int *n, int mang[])
2. Copy mt mng sang mt mng khc
void copy(int nguon[], int dich[], int n)
3. tm kim k trong mng, khng c tr v -1, c tr v chi so u tin
int tim(int mang[], int n, int k)
4. In danh sch v tr ca cc phn t c gi tr bng phn t nh nht
void nhonhat(int mang[], int n)
5. Nhn i gi tr ca cc phn t v tr l
void nhandoi(int mang[], int n)
6. Nhn i gi tr ca cc phn t l
void nhandoi1(int mang[], int n)
7. To ra mng khc c cc phn t theo th t ngc li
void mangnguoc(int nguon[], int dich[], int n)
8. To ra mng khc c cc phn t sx theo th t tng dn
void sxep(int nguon[], int dich[], int n)
9. chn k vo sau phn t th 3, nu s ft <3 th chn vo cui
void chen(int mang[], int *n, int k)
10. chn k vo sau phn t th k, nu s ft <k th chn vo cui
void chen1(int mang[], int *n, int k)
11. chn k vo trc phn t u tin ln hn k, nu khng c ft no ln hn k
th chn vo cui
void chen2(int mang[], int *n, int k)
12. Chn k vo sau phn t v tr chn
void chen3(int mang[], int *n, int k)
13. chn k phn t t 1k vo sau phn t chn u tin
void chen4(int mang[], int *n, int k)
14. copy k phn t cui cng ca mng ra mng khc

void copyk(int nguon[], int dich[], int k)

15. xa phn t chn u tin
void xoa(int mang[], int *n)
16. xoa phn t v tr k
void xoa1(int mang[], int *n, int k)
17. xa phn t u tin ln hn k
void xoa2(int mang[], int *n, int k)
18. xa phn t ln nht ca mng
void xoa3(int mang[], int *n)