@Gilles Ah, something new every day. Good call about the the comment.
@Patrick87 I see, too bad. Would have happened to me as well; I often comment after closing. Will have to be careful.
How was this question reopened, with one vote in favor and one against? Did one of you, @Gilles and @Patrick87, take action? If so, where could I see that?
Hi all here. I have created a cheat sheat of basic searching and sorting algorithms. Wiki has a such cheat sheet, but it does not have no. of comparisons & no. of swaps a sort algorithm requires in worst/ best case. I have included them. Shall I post this in CS.SE ? Is that allowed ?
@avi Hmmm. I don't know whether it is meaningful to collect knowledge Wikipedia-style. Why not improve Wikipedia instead?
Nevertheless, nice. You should, however, phrase it as Question-Answer-pair so that more can be added.
I think that such a post could become a useful reference, in particular if more precise and average case results are added. The only concern is whether SE is a good place for "dumb" loop-up knowledge. Opinions?
@avi Have to think on this. "What are time and space complexities of canonical algorithms?" would encourage additions, but would also be way, way too broad. Maybe restricting to sorting algorithms is enough? I don't really know.
The problem is also: How should one decide whether to upvote, assuming the facts are true? There is creative work in collecting (and referencing!) the results, and the question is not suited for examples or somesuch.
It's pure knowledge transfer; that's my concern. The other reference questions we have explain things (i.e. promote understanding) and/or display techniques (i.e. promote skill). This one does not. :/
I was learning about algorithms with polynomial time complexity. I found the following algorithms interesting.
Linear Search - with time complexity $O(n)$
Matrix Addition - with time complexity $O(n^2)$
Matrix Multiplication - with time complexity $O(n^3)$
Is there any algorithm with a highe...
I was learning about algorithms with polynomial time complexity. I found the following algorithms interesting.
Linear Search - with time complexity $O(n)$
Matrix Addition - with time complexity $O(n^2)$
Matrix Multiplication - with time complexity $O(n^3)$
Is there any algorithm with a highe...
