All Questions
Tagged with applied-theory algorithms
9 questions
1
vote
1
answer
692
views
Practical applications of the palindromic substring problem?
The longest palindromic substring problem is certainly an interesting intellectual exercise, and seems to be popular in coding interviews in industry. As an interesting puzzle, its popularity for ...
2
votes
1
answer
156
views
What are some practical problems which require the use of Kadane's algorithm?
I've worked through Kadane's and love its elegance. I am worried though, unless asked specifically about arrays and it's obvious that's what's for dinner, I won't know to use it.
What are some real-...
2
votes
1
answer
370
views
Assumptions when selecting an algorithm or data structure [closed]
As I understand it the nature of data access (sequential or random) will determine the optimal algorithm/data structure to use when manipulating data.
What other assumptions need to be checked before ...
3
votes
2
answers
2k
views
Is Bresenham's Line Drawing algorithm still used today?
If so, I cannot find any examples of this.
Edit: By "used", I mean are they still used in rendering in games or whatever. I haven't seen it used anywhere except in MS Paint because Wu's algorithm ...
30
votes
8
answers
8k
views
Is it a problem to be a programmer with no knowledge about computational complexity?
I've been assigned an exercise in my university. I took it home and tried to program an algorithm to solve it, it was something related to graphs, finding connected components, I guess.
Then I made ...
7
votes
1
answer
395
views
Travelling with the most efficient path
A friend of mine actually asked me a very interesting computer science related question, and I have been stuck on it for a long time.
The problem is: you have to travel $1000$ km. The only gas ...
10
votes
2
answers
8k
views
Is Dijkstras algorithm used in modern route-finding systems?
Is Dijkstra's algorithm used in modern route-finding systems such as Google maps or the satnav in your car? If not, then what is?
23
votes
3
answers
12k
views
Practical Applications of Radix Sort
Radix sort is theoretically very fast when you know that the keys are in a certain limited range, say $n$ values in the range $[0\dots n^k -1]$ for example. If $k<\lg n$ you just convert the ...
5
votes
2
answers
557
views
What are some applications of binary finite fields in CS?
I was looking at details on finite fields. Finite binary fields, e.g. $\mathbb{F_2}$, are used in CS in some places such as circuit theory [1].
What are some key applications of finite fields in ...