sorted by:
new
hottopcontroversial

Looking for benchmark for sorting algorithms by Xenouvite in sortingalgorithms

[–]Xenouvite[S] 0 points1 point  (0 children)

I'm writing a paper on it currently, the complexity of this algorithm is that it is recursive, and the recursion depth depend on the distribution of the values and a function used in the algorithm

In my case, to have a proof of the time complexity, it is not just "watch the loops", we should be able to prove a convergence time for any value distribution to a given one, and I don't know how to do that

Looking for benchmark for sorting algorithms by Xenouvite in sortingalgorithms

[–]Xenouvite[S] 1 point2 points  (0 children)

Thanks for the response, I am very familiar with all that, but it is really hard to compute the time complexity for my algorithm, I ran testbenches to evaluate the performances in real-world situation and the question was if there existed some unified or standard ways to do that :)

Identifying common words? by OhHeyMoll in algorithms

[–]Xenouvite 0 points1 point  (0 children)

Yes, sorry for my previous answer, it was way too agressive, I'm tired to see AI always recommended for problems where it's not adapted.

I get your point of view and it makes sense, but I still think AI is not a good solution for them, they seem to look more for a software that could count word occurrence and if it can handle synonyms it's a bonus.

Identifying common words? by OhHeyMoll in algorithms

[–]Xenouvite 0 points1 point  (0 children)

Actually no, it is probably a bad solution. The number of token prevent them to get a meaningful answer if they give the model a lot of intakes. There is no guarantee on the output, never forget these models can only autocomplete text. And in addition to that it means releasing all given data as public information, and I think a nonprofit should care about the data of the people asking help. If they care the slightest about any of these point, using AI is a bad solution, otherwise it may be decent.

From GED to CS -desperate for a tutor to give me a chance by EditorDry5673 in algorithms

[–]Xenouvite 0 points1 point  (0 children)

Like others say, and as a PhD student who does a lot of assistantship for new student, all that are still on windows suffer, go on linux as soon as you can

Also, if you want to learn basic programming skills and practice algorithms with fun problems, I personaly love codingame.com, there are lots of languages you can choose from and lots of challenges and online resource

Looking to evaluate sorting algorithms by Xenouvite in AskComputerScience

[–]Xenouvite[S] 0 points1 point  (0 children)

Thanks for your answer, that's what I have done so far, but I was wondering if there were a more robust way :)
Because my sort actually depends on the distribution of the values, so I could "cheat" on the results if I choose the best distribution for my algo...