Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
G
Greedy Algorithms in Class
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
SOFT Core
SOFT 260
Greedy Algorithms in Class
Commits
9edf0bea
Commit
9edf0bea
authored
2 years ago
by
Brady James Garvin
Browse files
Options
Downloads
Patches
Plain Diff
Implemented the greedy algorithm for the encoding problem.
parent
8daf85f6
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
greedy-algorithms/src/features/encoding/solver.js
+18
-1
18 additions, 1 deletion
greedy-algorithms/src/features/encoding/solver.js
with
18 additions
and
1 deletion
greedy-algorithms/src/features/encoding/solver.js
+
18
−
1
View file @
9edf0bea
import
{
PriorityQueue
}
from
'
./collections.js
'
;
export
function
findEncoding
(
frequencies
)
{
const
results
=
new
Map
();
const
partitioning
=
new
PriorityQueue
();
for
(
const
[
meaning
,
frequency
]
of
frequencies
)
{
results
.
set
(
meaning
,
''
);
partitioning
.
insert
(
new
Set
([
meaning
]),
frequency
);
}
while
(
partitioning
.
size
>
1
)
{
const
[
firstMeaningSet
,
firstFrequency
]
=
partitioning
.
remove
();
const
[
secondMeaningSet
,
secondFrequency
]
=
partitioning
.
remove
();
for
(
const
meaning
of
firstMeaningSet
)
{
results
.
set
(
meaning
,
`0
${
results
.
get
(
meaning
)}
`
);
}
for
(
const
meaning
of
secondMeaningSet
)
{
results
.
set
(
meaning
,
`1
${
results
.
get
(
meaning
)}
`
);
}
partitioning
.
insert
(
new
Set
([...
firstMeaningSet
,
...
secondMeaningSet
]),
firstFrequency
+
secondFrequency
,
);
}
// TODO: stub
return
results
;
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment