Advertisement
Robert_Manea

functie de cautare

Jan 9th, 2020
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. void sortare(int v[30],int n){
  5. int i,j,aux=0;
  6. for(i=0;i<n-1;i++){
  7. for(j=i+1;j<n;j++){
  8. if(v[i]>v[j]){
  9. aux=v[i];
  10. v[i]=v[j];
  11. v[j]=aux;
  12.  
  13. }
  14. } printf("introdu n:");
  15. scanf("%d",&n);
  16. }
  17. for(i=0;i<n;i++)
  18. printf("%d ",v[i]);
  19. }
  20. int cautare(int v[30],int n,int x){
  21. int i,z;
  22. for(i=0;i<n;i++)
  23. if(v[i]==x){
  24. z=i;
  25. break;
  26. }
  27.  
  28. return z;
  29. }
  30. int main()
  31. {
  32. int n,j,i,v[30],a,x;
  33.  
  34. printf("introdu n:");
  35. scanf("%d",&n);
  36. printf("introdu x:");
  37. scanf("%d",&x);
  38. for(i=0;i<n;i++){
  39. scanf("%d",&v[i]);
  40. }
  41. //sortare (v,n);
  42. a=cautare(v,n,x);
  43. printf("\n %d ",a);
  44.  
  45.  
  46.  
  47.  
  48. return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement