Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 1011
An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.
6
votes
3
answers
9k
views
Quicksort vs. insertion sort on linked list: performance
I have written a program to sort Linked Lists and I noticed that my insertion sort works much better than my quicksort algorithm.
Does anyone have any idea why this is?
Insertion sort has a complexit …
CommunityBot
- 1
5
votes
1
answer
1k
views
Dependency Graph - Acyclic graph
I have a directed acyclic graph where edge (A,B) means that vertex A depends on vertex B.
Vertex deletions have the following restrictions:
When vertex B is removed, all dependent vertexes should …
- 72.9k
1
vote
1
answer
172
views
Is open adressing with prime steps bijective?
Who can help me with this topic: Probing with a step width that is a prime number.
I am struggling with this question about defining a hashing function $h(k, i)$ for open addressing on a table of len …
- 615
5
votes
3
answers
4k
views
Counting different words in text using hashing
I am still fighting with hashing and I am ask myself: what is the most efficient way to count the number of different words in a text using a hash table?
My intuition says that applying the hashcode …
CommunityBot
- 1
4
votes
2
answers
3k
views
Running time - Linked Lists Polynomial
I have developed two algorithms and now they are asking me to find their running time.
The problem is to develop a singly linked list version for manipulating polynomials. … These are the algorithms I developed (in Pseudocode):
PolynomialAdd(Poly1, Poly2):
Degree := MaxDegree(Poly1.head, Poly2.head);
while (Degree >=0) do:
Node1 := Poly1.head;
while (Node1 …
- 72.9k
7
votes
4
answers
4k
views
Loop invariant for an algorithm
I have developed the following pseudocode for the sum of pairs problem:
Given an array $A$ of integers and an integer $b$, return YES if there are positions $i,j$ in $A$ with $A[i] + A[j] = b$, NO …
- 2,946