greedy | 易学教程

Selecting non-overlapping best quality clusters

阅读更多关于 Selecting non-overlapping best quality clusters

问题 Say, I have done clustering on my dataset and have 10 clusters. These clusters are non-overlapping. But now assume I changed some feature in all my data points and do clustering again. Now I have 10 more clusters. If I repeat it say 3 more times, at the end I would have 50 clusters. Each cluster has a score associated with it that is calculated from its constituents data points. These 50 clusters now have overlapping data points. I want to select all possible non-overlapping clusters out of

Integer overflow in greedy coin counting

阅读更多关于 Integer overflow in greedy coin counting

问题 #include <stdio.h> #include <cs50.h> #include <math.h> int main (void) { printf ("Enter amount: "); float amount = GetFloat(); int coins = 0; while (amount != 0) { if (fmod(amount, 0.25) == 0) { amount = amount - 0.25; coins += 1; } else if (fmod(amount, 0.10) == 0) { amount = amount - 0.10; coins += 1; } else if (fmod(amount, 0.05) == 0) { amount = amount - 0.05; coins += 1; } else { amount = amount - 0.01; coins += 1; } } printf ("Coins : %d\n", coins); } I'm trying to implement a small

How exactly does the possessive quantifier work?

阅读更多关于 How exactly does the possessive quantifier work?

问题 At the end of the page there is at attempted explanation of how do greedy, reluctant and possessive quantifiers work: http://docs.oracle.com/javase/tutorial/essential/regex/quant.html However I tried myself an example and I don't seem to understand it fully. I will paste my results directly: Enter your regex: .*+foo Enter input string to search: xfooxxxxxxfoo No match found. Enter your regex: (.*)+foo Enter input string to search: xfooxxxxxxfoo I found the text "xfooxxxxxxfoo" starting at

Process allocation algorithm

阅读更多关于 Process allocation algorithm

问题 I read some material on Algorithms, and ran into a problem. We have n processes, each with a predetermined start and end time. We want to use the minimum number of processors in order to run all these processes. Consider the following algorithm: In step i , select maximum number of currently unallocated processes that don't overlap, and allocate them to processor i . This algorithm finishes when no processes remain unallocated. The maximum i is the output of this algorithm. What is the

How to replace text using greedy approach in sed?

阅读更多关于 How to replace text using greedy approach in sed?

问题 I am parsing one file which has some html tag and changing into latex tag. cat text <Text>A ASDFF is a cerebrovafdfasfscular condifasdftion caufadfsed fasdfby tfdashe l ocfsdafalised ballooning or difdaslation of an arfdatery in thdfe bfdasrai n. Smadfsall aasdneurysms may dadisplay fdasno ofadsbvious sdfasigns (<str ong>asymptomatic) bfdasut lfdsaarger

Ignoring an optional suffix with a greedy regex

阅读更多关于 Ignoring an optional suffix with a greedy regex

问题 I'm performing regex matching in .NET against strings that look like this: 1;#Lists/General Discussion/Waffles Win 2;#Lists/General Discussion/Waffles Win/2_.000 3;#Lists/General Discussion/Waffles Win/3_.000 I need to match the URL portion without the numbers at the end, so that I get this: Lists/General Discussion/Waffles Win This is the regex I'm trying: (?:\d+;#)(?<url>.+)(?:/\d+_.\d+)* The problem is that the last group is being included as part of the middle group's match. I've also

How is Greedy Technique different from Exhaustive Search?

阅读更多关于 How is Greedy Technique different from Exhaustive Search?

问题 I have some sample problems that I'm writing pseudo code for and I'm noticing alarming patterns between the greedy technique and exhaustive search. Job 1, Job 2, Job 3, Job 4, Job 5 Person: 1 9 2 7 8 Person: 2 6 4 3 7 Person: 3 5 8 1 8 Person: 4 7 6 9 4 The above is the table example of an assignment problem. Basically, you have n amount of jobs to do, five here, and you need to complete them in the smallest amount of them were time is shown by the values attached to each person and their job

Improvement of the Greedy Algorithm

阅读更多关于 Improvement of the Greedy Algorithm

问题 I've been working on an abstract chess algorithm using Haskell (trying to expand my understanding of different paradigms), and I've hit a challenge that I've been pondering about for weeks. Here's the problem: Given a board (represented by a list of lists of integers; each integer represents a subsequent point value), with dimensions n x n, determine the path that provides the most points. If there is a tie for best path, return either of them. Here are the specifics: A = [[5,4,3,1],[10,2,1,0

Greedy Algorithm in “C”

阅读更多关于 Greedy Algorithm in “C”

I'm just start learning C language . I wrote this C code to implement Greedy algorithm I don't know what mistake I've made with this code, that code seems fine but its not working as I expected. Can anybody help me to fix this code? int main(void) { float amount = 0; int cents = 0; int count = 0; int amount_left = 0; amount = .30; cents = (int)round(amount * 100); printf("%d", cents); amount_left = cents; while (cents - 25 >= 0) { count = count + 1; amount_left = cents - 25; } while (amount_left - 10 >= 0) { count = count + 1; amount_left = amount_left - 10; } while (amount_left - 5 >= 0) {

Greedy Algorithm in “C”

阅读更多关于 Greedy Algorithm in “C”

问题 I'm just start learning C language . I wrote this C code to implement Greedy algorithm I don't know what mistake I've made with this code, that code seems fine but its not working as I expected. Can anybody help me to fix this code? int main(void) { float amount = 0; int cents = 0; int count = 0; int amount_left = 0; amount = .30; cents = (int)round(amount * 100); printf("%d", cents); amount_left = cents; while (cents - 25 >= 0) { count = count + 1; amount_left = cents - 25; } while (amount