Data structures-programs/ Exercise 1(searching)/Program_1.C

[20P31A1242]

1. / a)Write C program that use both recursive and non recursive functions to perform linear search for key value in a given list. /

2. includes

3. Void linearsearch(int val, int n, int arr[*]);

4. int linear_search_re(int val, int n, int arr[*]);

5. Void main() 6.{

6. int val , i, n, poss ;

7. Print("enter the size of an array:");

8. Scan f("%d",&n) ;

9. int arr [n];

10. Print if("\n enter theelements :") ;

11. for(i=0; i<n;i++)

12. {

13. Scan f ("%d" ,&arr[i]);

14. }

15. Print f("\n enter the value to
    Search: ") ;

16. Scan f("%d" , & val) ;

17. Print f ( "\n\n searching of an Element using non - recursive Function ") ;

18. Print f("\n ---------------------------------") ;

19. linear_ search(val,n,arr);

20. Print f("\n\n searching of an Element using recursive Function") ;

21. Print f ("\n-------------------------------");

22. Pos=linear_search_re(val,n,arr);

23. if(pos!=0)

24. Printf("\n element%d is Found at %d position",val, Pos) ;

25. else

26. Print f("\n%d is not found in the array",val);

27. }

28. Void linear_search(int val, int n, int arr[n])

29. {

30. int i, pos=-1;

31. for( i=0;i<n; i++)

32. {

33. if(arr[i]==val)

34. {

35. Pos= i ;

36. Print f("\n %d is
    found in the array at position%d",val, i+1);

37. }

38. }

39. if( poss==-1)

    41. Print f("\n %d does Nofound in the array",val);

40. }

41. int linear search re( int val, int n,int arr[n])

42. {

43. if( n>=0)

44. {

45. if (arr[n-1]==val)

46. Return n ;

47. else

48. return linear _ Search_re(val,n-1 ,arr) ;

49. }

50. }

[20P31A1242]

1. / a)Write C program that use both recursive and non recursive functions to perform linear search for key value in a given list. /

2. includes

3. Void linearsearch(int val, int n, int arr[*]);

4. int linear_search_re(int val, int n, int arr[*]);

5. Void main() 6.{

6. int val , i, n, poss ;

7. Print("enter the size of an array:");

8. Scan f("%d",&n) ;

9. int arr [n];

10. Print if("\n enter theelements :") ;

11. for(i=0; i<n;i++)

12. {

13. Scan f ("%d" ,&arr[i]);

14. }

15. Print f("\n enter the value to
    Search: ") ;

16. Scan f("%d" , & val) ;

17. Print f ( "\n\n searching of an Element using non - recursive Function ") ;

18. Print f("\n ---------------------------------") ;

19. linear_ search(val,n,arr);

20. Print f("\n\n searching of an Element using recursive Function") ;

21. Print f ("\n-------------------------------");

22. Pos=linear_search_re(val,n,arr);

23. if(pos!=0)

24. Printf("\n element%d is Found at %d position",val, Pos) ;

25. else

26. Print f("\n%d is not found in the array",val);

27. }

28. Void linear_search(int val, int n, int arr[n])

29. {

30. int i, pos=-1;

31. for( i=0;i<n; i++)

32. {

33. if(arr[i]==val)

34. {

35. Pos= i ;

36. Print f("\n %d is
    found in the array at position%d",val, i+1);

37. }

38. }

39. if( poss==-1)

    41. Print f("\n %d does Nofound in the array",val);

40. }

41. int linear search re( int val, int n,int arr[n])

42. {

43. if( n>=0)

44. {

45. if (arr[n-1]==val)

46. Return n ;

47. else

48. return linear _ Search_re(val,n-1 ,arr) ;

49. }