tagged [algorithm]
What is tail recursion?
What is tail recursion? Whilst starting to learn lisp, I've come across the term . What does it mean exactly?
- Modified
- 11 Oct at 02:32
Difference between Big-O and Little-O Notation
Difference between Big-O and Little-O Notation What is the difference between notation `O(n)` and notation `o(n)`?
- Modified
- 30 Jan at 13:47
Find the 2nd largest element in an array with minimum number of comparisons
Find the 2nd largest element in an array with minimum number of comparisons For an array of size N, what is the number of comparisons required?
What is stability in sorting algorithms and why is it important?
What is stability in sorting algorithms and why is it important? I'm very curious, why stability is or is not important in sorting algorithms?
- Modified
- 27 Dec at 22:10
How do you create an English like word?
How do you create an English like word? How do you create words which are not part of the English language, but sound English? For example: janertice, bellagom
How to implement a binary tree?
How to implement a binary tree? Which is the best data structure that can be used to implement a binary tree in Python?
- Modified
- 11 Aug at 06:50
Non-recursive depth first search algorithm
Non-recursive depth first search algorithm I am looking for a non-recursive depth first search algorithm for a non-binary tree. Any help is very much appreciated.
What is a plain English explanation of "Big O" notation?
What is a plain English explanation of "Big O" notation? I'd prefer as little formal definition as possible and simple mathematics.
- Modified
- 22 Jul at 15:40
What's the fastest algorithm for sorting a linked list?
What's the fastest algorithm for sorting a linked list? I'm curious if O(n log n) is the best a linked list can do.
- Modified
- 2 Jun at 00:50
What is the best way to find all combinations of items in an array?
What is the best way to find all combinations of items in an array? What is the best way to find all combinations of items in an array in C#?