View difference between Paste ID: L85LDrQP and infWgAwU

 function sortGrouped(t)
 	local users, precedence = {}, {}
-	for _, entry in ipairs(t) do
+	for i = #t, 1, -1 do
-		local name = entry.name
+		local name = t[i].name
-		table.insert(users, name)
+		if not users[name] then
-		precedence[name] = math.min(entry.i, precedence[name] or math.huge)
+			table.insert(precedence, name)
 			users[name] = {}
-	table.sort(users, function(a,b) return precedence[a] < precedence[b] end)
+		end
-	for i, name in ipairs(users) do
+		table.insert(users[name], table.remove(t))
-		users[name] = i
+
 	local function byI(a, b)
-	table.sort(t, function(a, b) if a.name == b.name then return a.i < b.i else return users[a.name] < users[b.name] end end)
+		return a.i > b.i
 	end
 	for name, list in pairs(users) do
 		table.sort(list, byI)
 	end
 	table.sort(precedence, function(a, b) return users[a][1].i > users[b][1].i end)
 	for _, name in ipairs(precedence) do
 		for _, entry in ipairs(users[name]) do
 			table.insert(t, entry)
 		end
 	end
 end