You are viewing a single comment's thread. Return to all comments →
In Python, this problem can be solved by modifying 3 lines of code only
def findZigZagSequence(a, n): a.sort() mid = n//2 # 1st modification a[mid], a[n-1] = a[n-1], a[mid] st = mid + 1 ed = n - 2 # 2nd modification while(st <= ed): a[st], a[ed] = a[ed], a[st] st = st + 1 ed = ed - 1 # 3rd modification for i in range (n): if i == n-1: print(a[i]) else: print(a[i], end = ' ') return
Seems like cookies are disabled on this browser, please enable them to open this website
Zig Zag Sequence
You are viewing a single comment's thread. Return to all comments →
In Python, this problem can be solved by modifying 3 lines of code only