Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct.

Given an array of integers, print a sum triangle from it such that the first level has all array elements. From then, at each level number of elements is one less than the previous level and elements at the level is be the Sum of consecutive two elements in the previous level. Input The single line of input contains an array of integers, each of it is separated by space Output Triangle form that has been created from the input array Sample Input1 12345 Sample Output1 48 20 28 8 12 16 3579 12345

For each n-element array an, the first element is always what is returned by a[1]. What is true, and what is false?