Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int sekvencijalno( int arr[], int n, int target ) {
- for( int i = 0 ; i < n ; ++i )
- if( arr[ i ] == target )
- return i; //nasao ga je
- return -1; //nije ga nasao
- }
- int sekvencijalno_sa_cuvarom( int arr[], int n, int taget ) {
- int pos = 0;
- arr[ n ] = target;
- while( arr[ pos++ ] != target );
- --pos;
- if( pos == N )
- return -1; //nije ga nasao
- else
- return pos; //nasao ga je
- }
- int binarno( int arr[], int n, int target ) {
- int low = 0;
- int high = n-1;
- int middle;
- while( high >= low ) {
- middle = ( low + high ) / 2;
- if( arr[ middle ] == target )
- return middle;
- else if( arr[ middle ] > target )
- high = middle - 1;
- else
- low = middle + 1;
- }
- if( arr[ middle ] == target )
- return middle; //nasao ga je
- else
- return -1; //nije ga nasao
- }
- int vjerojatnost( int arr[], int n, int target ) {
- for( int i = 0 ; i < n ; ++i ) {
- if( arr[ i ] == target ) {
- if( i > 0 ) {
- swap( arr[ i ], arr[ i-1 ] );
- return i-1; //nasao ga je
- }
- }
- }
- return -1; //nije ga nasao
- }
- int sekvencijalno_uredene_liste( int arr[], int n, int target ) {
- int pos = 0;
- if( arr[ n-1 ] <= target )
- while( arr[ pos++ ] < target );
- else return -1;
- --pos;
- if( arr[ pos ] == target )
- return pos;
- else return -1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement