Search pivot Element

2012-10-08T22:54:00.003-07:00

//Solution for finding a pivot element in a rotated array.

typedef int IntArray[7];

int findPivot(int[],int low,int high);

int main(int argc, const char * argv[])

{

IntArray myArr = {3,4,5,6,7,1,2};

int number = findPivot(myArr, 0, 7);

printf("%d",number);

getchar();

return 0;

}

int findPivot(int myArr[],int low,int high)

{

if(low < high)

{

int mid = (low + high) / 2;

if(myArr[mid] > myArr[mid +1])

return mid;

else if(myArr[mid] > myArr[low])

return findPivot(myArr, mid+1, high);

else

return findPivot(myArr, low, mid-1);

}

else

{

return -1;

}

Reverse a Link List

2012-10-08T02:56:00.001-07:00

Hello,

I am publishing the code for reverse a link list by two methods:

// It will simply reverse a link list using iteration.

void reverseNonRecursive(_link_list_st* head)

{

_link_list_st* prevLink = head->next_data;

_link_list_st* nextLink = prevLink->next_data;

prevLink->next_data = NULL;

while (1)

{

_link_list_st* temp = nextLink->next_data;

nextLink->next_data = prevLink;

prevLink = nextLink;

nextLink = temp;

if(nextLink == NULL)

{

head->next_data = prevLink;

break;

}

//It will used recursion to reverse a link list.

// To call this method we need "reverseRecursive(head,NULL);"

void reverseRecursive(_link_list_st* ptr,_link_list_st* prev)

{

static _link_list_st* link_head = NULL;

if(prev == NULL)

{

link_head = ptr;

ptr = link_head->next_data;

}

if(ptr == NULL)

{

link_head->next_data = prev;

}

else

{

reverseRecursive(ptr->next_data,ptr);

ptr->next_data = prev;

}

ProgrammingProblem

Search pivot Element

Reverse a Link List