Recursive

0

Print permutation
C
1
2
3
4
5
6
7
8
9
10
11
12
13
14
#include<stdio.h>
#define SIZE 3
// compiled on gcc
int main( char *argv [] , int argc )
{
char list[3] = { 'a' , 'b' , 'c' };
int i , j , k ;
for( i = 0 ; i < SIZE ; i++ )
for( j = 0 ; j < SIZE ; j++ )
for( k = 0 ; k < SIZE ; k++ )
if( i != j && j != k && i != k )
printf("%c%c%c\n", list[i],list[j],list[k] );
return ( 0 ) ;
}

//Recursive Program

Print Permuation Recursively
C
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <stdio.h>
#define N 5
// compiled on gcc
void permute( char list[] , int k , int m )
{
int i;
char temp;
if( k == m )
{
/* PRINT A FROM k to m! */
for( i = 0 ; i < N ; i++ )
{
printf("%c",list[ i ] );
}
printf("\n");
}
else
{
for( i = k ; i < m ; i++ )
{
/* swap(a[i],a[m-1]); */
temp = list[ i ] ;
list[i] = list[ m - 1] ;
list[ m - 1 ] = temp ;
permute( list , k , m -1 ) ;
/* swap(a[m-1],a[i]); */
temp = list[ m -1] ;
list[ m - 1 ] = list[ i ];
list[ i ] = temp;
}
}
}
int main( char *argv[] , int argc )
{
char list[5] = { 'a' , 'b' , 'c' , 'd' , 'e' };
permute( list , 0 , N );
return 0;
}

1,125 total views, 5 views today

1,125 total views, 5 views today

0

 

Binary Search Algo Imlementation
C++
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
// Compiled using g++/gcc
#include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
 
int  BinarySearch(int* arr, int first, int last, int key){
    int mid=(first+last)/2;
    if(first>last)
        return 0;
    if(arr[mid]<key)
    BinarySearch(arr,mid+1,last,key);
    else if(arr[mid]==key)
    {
        return (mid+1);
    }
    else
        BinarySearch(arr,first,mid-1,key);
 
}
int BInarySearchItr(int* array,int first,int last, int search)
{
    int middle = (first+last)/2;
 
       while (first <= last) {
          if (array[middle] < search){
             first = middle + 1;
          }
          else if (array[middle] == search) {
              return middle+1;
            
          }
          else
          last = middle - 1;
          middle = (first + last)/2;
       }
 
 
}
int main()
{
   int c, first, last, middle, n, search, array[100];
 
   printf("Enter number of elements\n");
   scanf("%d",&n);
 
   printf("Enter %d integers\n", n);
 
   for (c = 0; c < n; c++)
      scanf("%d",&array[c]);
 
   printf("Enter value to find\n");
   scanf("%d", &search);
 
   first = 0;
   last = n - 1;
  int pos= BinarySearch(array,first,last,search);
  printf("%d found at location %d.\n", search, pos);
  printf("Search By Iterative method\n");
  int pos1=BInarySearchItr(array,first,last, search);
  printf("%d found at location %d.\n", search, pos1);
 
   return 0;
}

1,060 total views, 10 views today

1,060 total views, 10 views today