Programmer Analyst

Tip 1 : 1st element of the array should be considered in the count of the result.
Tip 2 : For example :
Arr[]={7,4,8,2,9}
As 7 is the first element, it will consider in the result.
Tip 3 : 8 and 9 are also the elements that are greater than all of its previous elements.
Since total of 3 elements is present in the array that meets the condition. Hence the output = 3.

Tip 1 : Initialize three pointers prev as NULL, curr as head and next as NULL.
Tip 2 : Iterate through the linked list. In loop, do following. 
// Before changing next of current, 
// store next node 
next = curr->next
// Now change next of current 
// This is where actual reversing happens 
curr->next = prev 
// Move prev and curr one step forward 
prev = curr 
curr = next

Tip 1 : Divide the unsorted array into n subarrays, each of size 1 (an array of size 1 is considered sorted).
Tip 2 : Repeatedly merge subarrays to produce new sorted subarrays until only 1 subarray is left, which would be our sorted array.