GitHub - tabed23/Red_Black_Tree_Sort: You have N elements array but you are given that there are only K distinct values which have been repeated again and again in any order. For example N could be 1000 and K could be 10 means that the array contains only 10 values which are being duplicated anywhere in the array. Now you want to sort that array. You must have to give appropriate implementation using vector, map or set (libraries in STL) or anything you like. Your algorithm should take O(N log K) time instead of O(N log N). Drive time complexity. Given BST/RedBlak Tree LNR gives us the sorted order.

tabed23 / Red_Black_Tree_Sort Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

You have N elements array but you are given that there are only K distinct values which have been repeated again and again in any order. For example N could be 1000 and K could be 10 means that the array contains only 10 values which are being duplicated anywhere in the array. Now you want to sort that array. You must have to give appropriate im…