0% found this document useful (0 votes)
43 views6 pages

Tema - Lab 3

The document contains 16 code snippets that demonstrate various algorithms for processing arrays in C programming, including counting elements that meet certain criteria, finding the maximum/minimum value, reversing an array, inserting/deleting elements, and sorting arrays. The snippets cover basic operations like input, iteration, conditional checks, and output.

Uploaded by

George Pață
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views6 pages

Tema - Lab 3

The document contains 16 code snippets that demonstrate various algorithms for processing arrays in C programming, including counting elements that meet certain criteria, finding the maximum/minimum value, reversing an array, inserting/deleting elements, and sorting arrays. The snippets cover basic operations like input, iteration, conditional checks, and output.

Uploaded by

George Pață
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

#include <stdlib.

h>
#include <stdio.h>

//Ex 3.1
/*
int main (){
int n,cnt=0,v[50];
scanf("%d",&n);
for (int i=1; i<=n; i++) {
scanf("%d",&v[i]);
if(v[i]==0) cnt++;
}
printf("%d",cnt);
} */

//Ex 3.2
/*
int main (){
int n,maxim=0,v[50];
scanf("%d",&n);
for (int i=1; i<=n; i++){
scanf("%d",&v[i]);
if (maxim<v[i]) maxim=v[i];
}
printf("%d",maxim);
} */

//Ex 3.3
/*
int main (){
int n,minim=9999,v[50];
scanf("%d",&n);
for (int i=1; i<=n; i++){
scanf("%d",&v[i]);
if (v[i]<minim) minim=v[i];
}
for (int i=1; i<=n; i++)
if (minim==v[i]) printf("%d",i);
} */

//Ex 3.4
/*
int main (){
int n,cnt=0,v[50];
scanf("%d",&n);
for (int i=1; i<=n; i++)
scanf("%d",&v[i]);
for (int i=n; i>=1; i--)
printf("%d ", v[i]);
} */
//Ex 3.5
/*
int main (){
int v[1000],x,n=1,s=0;
scanf("%d",&x);
while (x!=0){
v[n]=x;
n++;
s+=x;
scanf("%d",&x);
}
n--;
printf("%d", s/n);
} */

//Ex 3.6
/*
int main (){
int v[100],x,n=1,cnt=0;
scanf("%d",&x);
while (x!=0){
v[n]=x;
n++;
if (x%2==0) cnt++;
scanf("%d",&x);
}
n--;
printf("%d",cnt);
} */

// Ex 3.7
/*
int main (){
int v[100],x,n=1,cntp=0,cntimp=0;
scanf("%d",&x);
while (x!=0){
v[n]=x;
n++;
if (x%2==0) cntp++;
else cntimp++;
scanf("%d", &x);
}
n--;
printf("%d %d", cntp, cntimp);
} */

//Ex 3.8
/*
int main (){
int n,m,cnt=0,ok;
scanf("%d%d",&n,&m);
int v[n],u[m];
for (int i=1; i<=n; i++) scanf("%d",&v[i]);
for (int i=1; i<=m; i++) scanf("%d",&u[i]);
for (int i=1; i<=m; i++){
ok=1;
for (int j=1; j<=n&&ok; j++)
if (u[i]==v[j]) ok=0;
if (ok==0) cnt++;
}
if (cnt==m) printf("Sirul u este subsir al lui v");
else printf("U nu este subsir al lui v");
} */

//Ex 3.9
/*
int main (){
int n,x,ok=1,mij,v[50];
scanf("%d%d",&n, &x);
for (int i=1; i<=n; i++) scanf("%d",&v[i]);
int st=0,dr=n;
while (st<=dr && ok){
mij=(st+dr)/2;
if (v[mij]==x) ok=0;
else if (v[mij]>x) dr=mij-1;
else if (v[mij]<x) st=mij+1;
}
printf ("%d", mij);
} */

//Ex 3.10
/*
int main (){
int n,v[50],cnt=0,x;
scanf("%d%d",&n, &x);
for (int i=1; i<=n; i++) scanf("%d", &v[i]);
for (int i=1; i<=n; i++){
if (v[i]==x) {
cnt++;
printf("%d " ,i);
}
}
printf("\n");
printf("%d", cnt);
} */

//Ex 3.11
/*
int main (){
int n,v[50];
scanf("%d",&n);
for (int i=1; i<=n; i++) scanf("%d", &v[i]);
int cnt=1;
for (int j=n+1; j>=cnt+1; j--) v[j]=v[j-1];
n++; v[cnt]=0;
for (int i=1; i<=n; i++) printf("%d ", v[i]);
} */

// 1 2 3 4 5
// 10 20 40 50 60

//Ex 3.12
/*
int main (){
int n,k,ok=1;
scanf("%d%d", &n, &k);
int v[n];
for (int i=1; i<=n; i++) scanf("%d", &v[i]);
for (int i=1; i<=n && ok; i++){
if (v[i]>k){
for (int j=n+1; j>=i+1; j--)
v[j]=v[j-1];
n++; v[i]=k; ok=0;
}
}
for (int i=1; i<=n; i++) printf("%d ",v[i]);
} */

//Ex 3.13
/*
int main (){
int n,cnt;
float maxim=0;
scanf("%d", &n);
float v[n];
for (int i=1; i<=n; i++){
scanf("%f",&v[i]);
if (maxim < v[i]){
maxim=v[i];
cnt=i;
}
}
if (cnt!=n){
int aux=v[cnt];
v[cnt]=v[n];
v[n]=aux;
for (int i=1; i<=n; i++) printf("%f ", v[i]);
} else printf ("Maximul este ultimul element");
} */

// Ex 3.14
/*
int main (){
int n,k,cnt;
scanf("%d%d", &n, &k);
int v[n],maxim=n;
for (int i=1; i<=n; i++) scanf("%d", &v[i]);
for (int i=1; i<=n; i++){
cnt=n;
if (v[i]==k && i<maxim){
while (v[cnt]==k) cnt--;
int aux=v[i];
v[i]=v[cnt];
v[cnt]=aux;
maxim--;
}
}
for (int i=1; i<=n; i++) printf("%d ", v[i]);
} */

//Ex 3.15
/*
int main (){
int n;
scanf("%d",&n);
int v[n];
for (int i=1; i<=n; i++) scanf("%d",&v[i]);
for (int i=1; i<=n; i++){
if (v[i]==0){
for (int j=i; j<=n-1; j++) v[j]=v[j+1];
n--;
}
}
for (int i=1; i<=n; i++) printf("%d ", v[i]);
} */

//Ex 3.16
/*
int main (){
int n,x,c,aux;
scanf("%d",&n);
int v[n];
for (int i=1; i<=n; i++) scanf("%d",&v[i]);
c=1;
for (int i=2; i<=n; i++){
if (v[i]<v[c]){
aux=v[i];
v[i]=v[c];
v[c]=aux;
c=i;
if (v[i-1]>v[c]){
int cnt=i-1;
if (v[cnt]>v[c])
while (v[cnt]>v[c] && cnt>=1){
aux=v[cnt];
v[cnt]=v[c];
v[c]=aux;
cnt--; c--;
}
}
}
}
for (int i=1; i<=n; i++) printf("%d ", v[i]);
} */

You might also like