The complexity of following sort is O(nlogn). Merge Sort. Quick Sort Heap sort.
Merge Sort. => Need extra space . Quick Sort => worst case complexity O(n2). Heap Sort => Always grantee the complexity O(nlogn). IN RTOS heap Sort is used.
Help me to write a C program which can generate list of numbers which are palindrome in decimal and octal notion. You can take some max as a limit find out all numbers which satisfy the given property between 1 to n.
For example: It returns ‘b’ when the input is “abaccdeff”.
40 /\ 20 60 /\ \ 10 30 80 / /\ 25 70 90 \ 75 longest path 25 30 20 40 60 80 70 75 Answer 25 ----> 75
You have two arrays A1 and A2. Delete all element from A1 which are already in A2 and return new array.
