Thesupernile

Currently Posting Programming Updates on my journey to making a sorting algorithm visualiser. New sorting algorithm every day :)

[Thesupernile @nile_super]

Sorting Algorithms Day 11:

Pancake sort imagines the list as a stack of pancakes which can only be reordered by flipping the entire list up to a certain point

#pancakesort #sorting #programmingfundamentals #javascript

[Thesupernile @nile_super]

Sorting Algorithms Day 11:

Pancake sort imagines the list as a stack of pancakes which can only be reordered by flipping the entire list up to a certain point

#pancakesort #sorting #programmingfundamentals #javascript

[Thesupernile @nile_super]

Sorting Algorithms Day 11

Gnome Sort imagines the list as a set of pots that a gnome must sort. It checks two pots. If they are in the right order, it will move to the next pair, if they are not, it swaps them and moves to the previous pair

#gnomesort #satisfactory #programming

[Thesupernile @nile_super]

If you want to go and visualise this sorting algorithm or any others, check out the website here: https://t.co/49b753FkrB
Or the source code here: https://t.co/h9TUIEJrcG…

[Thesupernile @nile_super]

Sorting Algorithms Day 11

Gnome Sort imagines the list as a set of pots that a gnome must sort. It checks two pots. If they are in the right order, it will move to the next pair, if they are not, it swaps them and moves to the previous pair

#gnomesort #satisfactory #programming

[Thesupernile @nile_super]

Sorting Algorithms Day 7

Quick sort arranges elements as being greater than or less than a chosen "pivot" element. Repeatedly doing this allows the whole list to be sorted. Complexity: O(nlogn)

#programingfundamentals #quicksort #satisfying

[Thesupernile @nile_super]

@sonderly_Retake Love it!

[Thesupernile @nile_super]

If you want to go and visualise this sorting algorithm or any others, check out the website here: https://t.co/49b753FkrB
Or the source code here: https://t.co/h9TUIEJrcG…

[Thesupernile @nile_super]

Sorting Algorithms Day 7

Quick sort arranges elements as being greater than or less than a chosen "pivot" element. Repeatedly doing this allows the whole list to be sorted. Complexity: O(nlogn)

#programingfundamentals #quicksort #satisfying

[sonderly @sonderly_Retake]

Tiers are also in order, don’t at me I’m just right.
#Minecraft

[Thesupernile @nile_super]

Sorting Algorithms Day 6

Merge sort splits a list into smaller sub lists, sorts each sub list then merges the two lists together. By doing this, it needs to do substantially less comparisons. Complexity: O(n log(n))

#programmingfundamentals #mergesort #satisfactory

[Thesupernile @nile_super]

If you want to go and visualise this sorting algorithm or any others, check out the website here:
https://t.co/49b753FkrB
Or the source code here:
https://t.co/h9TUIEJrcG

[Thesupernile @nile_super]

Sorting Algorithms Day 6

Merge sort splits a list into smaller sub lists, sorts each sub list then merges the two lists together. By doing this, it needs to do substantially less comparisons. Complexity: O(n log(n))

#programmingfundamentals #mergesort #satisfactory

[Thesupernile @nile_super]

Sorting Algorithms Day 4:

Selection Sort goes through the list and selects from the unordered part which element should come next. It has a big O of O(N^2).

Check it out for yourself at:
https://t.co/49b753FSh9

#javascript #programmingfundamentals

[Thesupernile @nile_super]

Sorting Algorithms Day 4:

Selection Sort goes through the list and selects from the unordered part which element should come next. It has a big O of O(N^2).

Check it out for yourself at:
https://t.co/49b753FSh9

#javascript #programmingfundamentals

[Thesupernile @nile_super]

Day 3:
Today's algorithm is insertion sort. It works by taking each element from the unsorted list and inserting it into the correct position in the sorted side of the list.
See visualisation below:

If you liked this, check it out at https://t.co/49b753FkrB

Happy programming :)

[Thesupernile @nile_super]

Day 3:
Today's algorithm is insertion sort. It works by taking each element from the unsorted list and inserting it into the correct position in the sorted side of the list.
See visualisation below:

If you liked this, check it out at https://t.co/49b753FkrB

Happy programming :)

[sonderly @sonderly_Retake]

Die die die

[Thesupernile @nile_super]

Day 2 making a sort visualiser:

I made a Bubble Sort visualisation. It runs through the list and swaps adjacent elements if they are the wrong way around.

Check it out:
https://t.co/h9TUIEJrcG
https://t.co/49b753FkrB

Happy Programming :)

#programmer #javascript #sorting

[Thesupernile @nile_super]

Day 2 making a sort visualiser:

I made a Bubble Sort visualisation. It runs through the list and swaps adjacent elements if they are the wrong way around.

Check it out:
https://t.co/h9TUIEJrcG
https://t.co/49b753FkrB

Happy Programming :)

#programmer #javascript #sorting