Sort Functions - Revision history

Zver-CR at 19:07, 27 September 2023

2023-09-27T19:07:34Z

← Older revision		Revision as of 19:07, 27 September 2023
Line 80:		Line 80:

	</section>		</section>

			==See Also==
	{{Useful_Functions}}		{{Useful_Functions}}

Conolel: /* Code */

2018-09-01T12:42:51Z

Code

← Older revision		Revision as of 12:42, 1 September 2018
Line 5:		Line 5:

	<syntaxhighlight lang="lua">		<syntaxhighlight lang="lua">
	table ~~InsertSortingByIndex~~(table t, int SortByKey)		table insertSortingByIndex(table t, int SortByKey)
	table ~~FixedBubbleSortingByIndex~~(table t, int SortByKey)		table fixedBubbleSortingByIndex(table t, int SortByKey)
	</syntaxhighlight>		</syntaxhighlight>

Line 15:		Line 15:
	For Example if our table has values like this, then you would specify 3:		For Example if our table has values like this, then you would specify 3:
	{player, vehicle, playerid, npc}		{player, vehicle, playerid, npc}
	local table = ~~InsertSortingByIndex~~(table, 3)		local table = insertSortingByIndex(table, 3)
	<syntaxhighlight lang="lua">		<syntaxhighlight lang="lua">
	function ~~InsertSortingByIndex~~(array, e)		function insertSortingByIndex(array, e)
	local data = array		local data = array
	for i = 2, #data do		for i = 2, #data do
Line 34:		Line 34:
	o(n^2) Sorting algorithm for lua.		o(n^2) Sorting algorithm for lua.
	<syntaxhighlight lang="lua">		<syntaxhighlight lang="lua">
	function ~~FixedBubbleSortingByIndex~~(array, e)		function fixedBubbleSortingByIndex(array, e)
	local data = array		local data = array
	local i = #data		local i = #data
Line 69:		Line 69:
	{5, "test"},		{5, "test"},
	}		}
	local SortedTestArray = ~~FixedBubbleSortingByIndex~~(TestArray, 1)		local SortedTestArray = fixedBubbleSortingByIndex(TestArray, 1)
	for k, v in pairs(SortedTestArray) do		for k, v in pairs(SortedTestArray) do
	outputChatBox("Value: " .. v[1])		outputChatBox("Value: " .. v[1])
	end		end
	local SortedTestArray2 = ~~InsertSortingByIndex~~(TestArray, 1)		local SortedTestArray2 = insertSortingByIndex(TestArray, 1)
	for k, v in pairs(SortedTestArray2) do		for k, v in pairs(SortedTestArray2) do
	outputChatBox("Value: " .. v[1])		outputChatBox("Value: " .. v[1])

Myonlake at 19:11, 4 April 2018

2018-04-04T19:11:25Z

← Older revision		Revision as of 19:11, 4 April 2018
Line 1:		Line 1:
			{{Useful_Function}}

	==Code==		==Code==
	'''Sorting Algorithms provided by DreTaX		'''Sorting Algorithms provided by DreTaX
Line 78:		Line 80:

	</section>		</section>
			{{Useful_Functions}}

Dretax: Created page with "==Code== '''Sorting Algorithms provided by DreTaX table InsertSortingByIndex(table t, int SortByKey) table FixedBubbleSortingByIndex(table t, int..."

2017-10-07T14:37:39Z

Created page with "==Code== '''Sorting Algorithms provided by DreTaX <syntaxhighlight lang="lua"> table InsertSortingByIndex(table t, int SortByKey) table FixedBubbleSortingByIndex(table t, int..."

New page

==Code==
'''Sorting Algorithms provided by DreTaX

<syntaxhighlight lang="lua">
table InsertSortingByIndex(table t, int SortByKey)
table FixedBubbleSortingByIndex(table t, int SortByKey)
</syntaxhighlight>

<section name="Function source" class="both" show="true">

Insert Sorting works possibly the fastest way If we don't know how sorted our array is.
You need to specify a table, and the table's index which we will be using to sort with.
For Example if our table has values like this, then you would specify 3:
{player, vehicle, playerid, npc}
local table = InsertSortingByIndex(table, 3)
<syntaxhighlight lang="lua">
function InsertSortingByIndex(array, e)
local data = array
for i = 2, #data do
local j = i - 1
local ass = data[i]
while j > 0 and data[j][e] > ass[e] do
data[j + 1] = data[j]
j = j - 1
end
data[j + 1] = ass
end
return data
end
</syntaxhighlight>

o(n^2) Sorting algorithm for lua.
<syntaxhighlight lang="lua">
function FixedBubbleSortingByIndex(array, e)
local data = array
local i = #data
while i >= 2 do
local idx = 0
for j = 1, (i - 1) do
if data[j][e] > data[j + 1][e] then
local holder = data[j][e]
data[j][e] = data[j + 1][e]
data[j + 1][e] = holder
idx = j
end
end
i = idx
end
return data
end
</syntaxhighlight>

==Usage==
<syntaxhighlight lang="lua">
local TestArray = {
{1, "test"},
{33, "test"},
{-32, "test"},
{-1, "test"},
{5, "test"},
{11, "test"},
{968, "test"},
{723, "test"},
{33, "test"},
{16, "test"},
{4, "test"},
{5, "test"},
}
local SortedTestArray = FixedBubbleSortingByIndex(TestArray, 1)
for k, v in pairs(SortedTestArray) do
outputChatBox("Value: " .. v[1])
end
local SortedTestArray2 = InsertSortingByIndex(TestArray, 1)
for k, v in pairs(SortedTestArray2) do
outputChatBox("Value: " .. v[1])
end
</syntaxhighlight>

</section>