Hello Encode.su community members!
My name is Ananth Gonibeed and my username is urntme on this forum.
I previously posted on the data compression section of this forum.
Following some messages by other members of this community on other threads that I posted in, I decided to try and figure out how to code.
However, instead of trying to code the Data compression algorithm I mentioned in those threads, I decided to try something much simpler and much more accessible to my coding level for a first attempt.
I decided to try and code my “Instant sort” sorting algorithm.
So this sorting algorithm is called “Instant sort” and it basically instantly sorts numbers. It is an algorithm that I came up with. It has a time complexity of O(1) and it accomplishes this because it’s a new and different type of sorting algorithm.
You can read all about it in the attached paper.
I have attached a couple of things to the zip archive attached to this thread:
1) The paper describing “Instant Sort” the algorithm and the basic concept around it.
2) The executable you can run to test out a very very primitive version of the algorithm.
3) A document explaining how the code for the very very primitive version of the algorithm works.
4) The source code for the program I created.
I used C++ and the syntax was a bit unfamiliar to me at first but the thing works the way it’s supposed to so I can’t complain.
This is version 1 and I will probably build upon it further over time once I figure out how to do more complex versions of it.
Let me know your thoughts and anything you want to say.
Kudos,
Ananth.
P.S: You can contact me at this email id: ananth.gonibeed@gmail.com if you want to contact me personally for any reason.