Time complexity of sum of subsets problem using greedy method?

#1

what is the Time complexity of sum of subsets problem using greedy method?

#2

hello @POORVI_SAXENA
r u taking about fraction knapsack?.
if so then its time complexity is O(nlogn).
nlogn is for sorting and n for alogorithm so overall it is nlogn