Hi Rohan,
I assume that you are referring to this github issue:
https://github.com/sympy/sympy/issues/16249
It's good to reference the issue because most of the people on this
mailing list won't be familiar with it. Also it probably makes sense
to ask questions about the issue on the issue.
One
I am very very new to this organization, correct me if I didn't understand
the issue. And I don't know much about the code
Is there any progress?
Algo is surely O(n**2). But n**2 comparisions are required only if most of
the elements are uncomparable. In practice majority would be of similar
Hi everyone
This is Rohan Mallick, btech undergrad at IIT Roorkee Electrical. I have
learnt calculus, ode, numerical analysis in my college and it interests me.
I have been programming in python for 2 years. Before I had been
programming in c++. Previously I have made few c++ numerical
