TCS - Infosys Coding Questions | 2 in 1 | Half Asc. Half Des. + Swap without temp | Tamil | code io

[@S7GAMINGS]

Actually time complexity is o(n) if lots of collisions happen but its extremely worst case if the invigilator deliberately put all the elements in one position.best and average case isO(1).if sorted map time complexity is O(logN)

[@Hari-mt8xo]

Bro plz provide java solution for this problem??

[@bharathvijayp3276]

Bro c programming edpadi poodurathu

[@codeio]

kzbin.info/www/bejne/nJ62n3-fdttgsMU Ithula full course iruku bro .... All thr Best

[@bharathvijayp3276]

@@codeio intha ques ku c programming la logic sollunga

[@vishwayajith1758]

Use pivot variable to sort that is Insertion sort..will be O(nlogn)

[@codeio]

Awesome.... insertion sort is the right answer bro👏👏👏👏👍

[@prithiviraaj5090]

Insertion Sort

[@codeio]

👏👏👏👍👍👍👍👍

[@prithiviraaj5090]

@@codeio 🙌 🙌

[@hari3544]

Hash table