l********s
发帖数: 358 | 1 Thanks for the information, however I don't understand the algorithm in the
class. In the class "CombinationGenerator(int n, int r)", it requires r < n,
and in my case, I need r = n. |
|
n****y
发帖数: 106 | 2 你意思是先找k 条最短路径，然后在里面找出最短但是符合条件的
我们现在就是这么做的，但是manager想avoid k shortest paths algorithm...
我不明白为什么要avoid,但是我没有决定权
你还知道其他的算法么？
谢谢
找符 |
|
|
w***g
发帖数: 5958 | 4 看大家都不吱声，我来抛砖引玉。我其实没什么好的算法。我觉得就是需要O(nlog k)。
第三种情况可能有巧妙的办法，但是前两种情况没什么好说的：
k = 3: O(n), 好歹每个数都要看一遍吧。
k = n/2: O(nlogn)，因为k = n/2的复杂度和k = n其实是一样的，而排序n个数需要O(
nlogn)。
of
(a
for
algorithms. |
|
t****t
发帖数: 6806 | 5 这问题问的不清楚啊, 有多少空间限制, 能不能改原数, 都影响算法的嘛.
of
(a
for
algorithms. |
|
c*****t
发帖数: 1879 | 6 Assuming this "set" is randomly ordered and no constraint on the algorithm.
a. O (n). Has to spend O (n) time to scan. Sorting 3 numbers is O (1).
So overall O (n).
b. O (nlogn). Getting k largest numbers from n is O (n). But sorting
these numbers using comparison only is O (nlogn). So overall O (nlogn).
c. O (n). Finding these k numbers would take O (n) time. Sorting these
numbers should take O ( log n * log log n ) < O ( log^2 n) < O ( n).
So overall is O (n).
of
(a
for
al |
|
t****t
发帖数: 6806 | 7 partition based selection algorithm is linear on average (regardless of k). |
|
t****t
发帖数: 6806 | 8 in fact, when you find kth number with partition based algorithm, you
already found all number greater than it |
|
c*******8
发帖数: 16 | 9 感觉algorithms in c++ 太cs. |
|
c****l
发帖数: 1280 | 10 algorithms in c++ is good. what do you mean by "太cs" |
|
r*******n
发帖数: 3020 | 11 The sort algorithms based on comparison are limited by nlogn |
|
e****u
发帖数: 121 | 12 Dear all,
I am having a question on how to get statisitcal information on one
algorithm, for example, developed in C/C++. I would like to know how many
multiplications or divisions, or how many floating point operations have
been done for one running.
I was looking for some profiler tool which might helps, but could not get
one.
Thanks in advance,
eezhou, |
|
g*******y
发帖数: 1930 | 13 {0 1 2...k-1} 选N，两种情况
情况一：0 + {1..k-1}选N-1 C(k-1, N-1)
情况二：{1..k-1}选N C(k-1,N)
所有第一种情况的编号，要小于所有第二种情况的编号 (估计algorithmics就是这里有
个小疏忽吧)
所以，m'如果是大于 C(k-1, N-1)的话，就是第二种情况了，m'就要减去C(k-1,N-1) |
|
j********5
发帖数: 33 | 14 Hi,
Does anyone have "introduction to algorithms" 3rd edition?
thanks in advance. |
|
p***o
发帖数: 1252 | 15
那你可以先不用整智能指针，先把STL里的container/algorithm搞明白。
智能指针是用来包装new出来的东西的。
一般类的data member你都用new的吗？看起来不大对 ...
基本上你把container都搞明白就没有什么地方需要new了。 |
|
a********r
发帖数: 58 | 16 What's the underlying sort algorithm for SET in C++ STL? Thanks! |
|
a********r
发帖数: 58 | 17 but what's the built-in sorting algorithm for the sorted set if have? thanks
! |
|
a********r
发帖数: 58 | 18 but what's the built-in sorting algorithm for the sorted set if have? thanks
! |
|
s*******e
发帖数: 664 | 19 ☆─────────────────────────────────────☆
rainjq (LT) 于 (Wed Jul 15 19:29:13 2009, 美东) 提到:
发信人: rainjq (LT), 信区: JobHunting
标 题: An algorithm question
发信站: BBS 未名空间站 (Wed Jul 15 19:13:13 2009, 美东)
给一个map, 上面有很多城市，城市之间能互通的用一个wighted edge连接起来. 问给
你n个城市，构成一个所有边之和最小并且n个城市中每二个城市之间都能互通的
network。
☆─────────────────────────────────────☆
ilvch (From here to eternity) 于 (Wed Jul 15 22:24:32 2009, 美东) 提到:
minimum spanning tree?
☆─────────────────────────────────────☆
ilvch (From here to eternit |
|
d*****r
发帖数: 57 | 20 【 以下文字转载自 CS 讨论区 】
发信人: driftor (信天游), 信区: CS
标 题: Google 电面 algorithm 问题
发信站: BBS 未名空间站 (Mon Mar 29 00:02:17 2010, 美东)
N bidders bid on N merchandises. Each bidder provides a bidding price on
every of the N merchandises, P(i,j). How to allocate the merchandises to
each the bidder to maximize the revenue? (Of coz, each merchandise can be
sold to one and only one bidder.)
感觉应该是很基本的问题，可惜本人背景太弱，望不吝赐教，多谢！ |
|
f**********8
发帖数: 2276 | 21 【 以下文字转载自 JobHunting 讨论区 】
发信人: foolsgarden8 (小兔子), 信区: JobHunting
标 题: 求<>电子书下载
发信站: BBS 未名空间站 (Sun Jun 6 18:05:33 2010, 美东)
rt. thanks. |
|
l********a
发帖数: 28 | 22 准备搜集面试的算法知识，这本书好像还有个Graph Algorithm Part5， 这本值得买吗？
先谢谢各位大牛！ |
|
c********2
发帖数: 56 | 23 Design an algorithm to find the frequency of a bunch of random numbers |
|
|
p*********t
发帖数: 2690 | 25 看了一眼,咋觉得就是Data structure and algorithm呢？而且里面的程序不用java,c+
+,甚至不是pascal. |
|
xt
发帖数: 17532 | 26 Data Structure and Algorithm for Dummies. :D |
|
a*w
发帖数: 4495 | 27 楼主要短的，可以用 Aho 的 Data Structure and Algorithms, 才400页。 |
|
xt
发帖数: 17532 | 28 Data Structure and Algorithm for Dummies. :D |
|
a*w
发帖数: 4495 | 29 楼主要短的，可以用 Aho 的 Data Structure and Algorithms, 才400页。 |
|
|
w*s
发帖数: 7227 | 31 so you guys heard the hews that yahoo bought Summly,
anyone can explain more on the algorithm used by Summly ?
Any open source on this topic ?
Thanks a lot ! |
|
|
|
g****5
发帖数: 1639 | 34 【 以下文字转载自 JobHunting 讨论区 】
发信人: gtrr35 (GTR-R35), 信区: JobHunting
标 题: 谁有Data Structures and Algorithms Made Easy 2nd Edition电子书？
发信站: BBS 未名空间站 (Thu Feb 6 17:04:12 2014, 美东)
能不能分享一下。
我在网上找了个下载的链接：
http://ebooks4us.org/2013/05/download-data-structures-and-algor
下载下来的是个.rar文件，需要密码解压缩。没找到密码。哪位高人要是能帮忙破解也
行。
多谢多谢！ |
|
n*****3
发帖数: 1584 | 35 【 以下文字转载自 JobHunting 讨论区 】
发信人: nacst23 (cnc), 信区: JobHunting
标 题: 问一道(大)数据 algorithm
发信站: BBS 未名空间站 (Sun Mar 22 00:11:01 2015, 美东)
请教大家一下：
两组人， POSITIVE 和 Negative ，
say
POSITIVE 100K ppl，
Negative 900K ppl.
基本的数据结构 是 人的 ID 和 length of stay（待了几天）。
ID length of stay(days)
ppl-0000001 8
ppl-0000002 10
...
目的是 sample Negative 组 出来 100K 人 ,
which one-to-one match the Positive 组 人
的 length of stay（待了几天），
这样 match 完, 两组人的 100K 个 length of stay（待了几天）
完全... 阅读全帖 |
|
n*****3
发帖数: 1584 | 36 the for loop will take a long time to finish;
I want to figure out some good algorithm/Data strucute
to speed it up. Thanks. |
|
z**w
发帖数: 3 | 37 I want to know how to detect whether a word file includes
any macros.
I will develop it under UNIX, so I can not use windows or
Microsoft's dll.
Is there any algorithm or suggestion?
Thanks in advance. |
|
J*****n
发帖数: 48 | 38 我的algorithm太长，超过一页，latex把它压在一页，结果下面都接近
页面底部，怎么样让它正常分页？thanks |
|
n***l
发帖数: 1468 | 39 latex写文章,
可否把equation, algorithm, table这3个environment里面的东西, 统统缩小一点? 要
不然太占地方了.
就像\includegraphics[scale=0.3]{aaa.eps}一样, |
|
f********g
发帖数: 4 | 40 【 以下文字转载自 Software 讨论区 】
【 原文由 frostzhong 所发表 】
I want to compare two algorithms. I need the empirical data of their CPU
time. How can I do it? use special software or programming it myself using
some specific functions? |
|
s********1
发帖数: 581 | 41 谁能推荐有关算法(computation algorithm)的书籍？
使用的语言包括C, C++, C#, FOTRAN, 或者JAVA。 记得有一本书好叫做"...Numerical
Recipes", 不晓得书名对不对？适用哪种语言？书中是否带有光盘程序？
还有其他的书可以推荐吗？ |
|
k*********r
发帖数: 758 | 42 【 以下文字转载自 Science 讨论区,原文如下 】
发信人: kingforever (蛋糕屎), 信区: Science
标 题: Anybody tried sorting algorithm from NR?
发信站: The unknown SPACE (Mon Apr 22 21:03:33 2002) WWW-POST
i tried sort2(n, a, b), which sorts a while re-arranging b. doesn't seem to
work. anybody else has the same problem? |
|
z*p
发帖数: 10 | 43 Hi, I am thinking of writing a program based on Genetic Algorithm. Anyone
knows what's the best approach for it? What existing program or library online
is the easiest to use?
3x a lot!
zzp |
|
d*****i
发帖数: 17 | 44 请问genetic algorithm有没有deal with different fitness functions at the same
time的例子? For example, 在那个salesman trip的例子中, 假设n salesmen要分别去n
sets of cities, 然后要找出最短距离among all the salesmen trips.
Thank you! |
|
s*****k
发帖数: 3 | 45 i am trying to write code for fft myself. of cause i think it is ok if it can
run. someone can tell me some references on fft algorithm.
thanks! |
|
S***y
发帖数: 186 | 46 I think the problem is that the best algorithms are usually not
well documented. |
|
r****e
发帖数: 9 | 47 Given an array A with positive numbers, find an efficient algorithm to find
out the Maximum of A[j]-A[i], j>i.
My solution is: Divide the array into two parts, first half and second half.
Then the location of j and i have three possibles. 1) j,i are in the first
half. 2) j, i are in the second half. 3) i is in the first and j in sencond.
For 1) and 2), I can use recursive to find out. For 3) I need to find out the
minimum element in the first half and the maximum element in the second half.
Then |
|
c****l
发帖数: 1280 | 48 who has the solutions for this book?
书名：算法I~IV（C++实现）——基础、数据结构、排序和搜索（第三版 ）
Algorithms in C++,Parts 1-4:Fundamentats,Data Structures,Sorting,and
Searching,3e
出版社 Pearson Education
作者: Robert Sedgewick
could you send it to c**************[email protected]
thank |
|
d*****n
发帖数: 754 | 49 I'm investigating a method to automatically detect organic vapor plumes from
IR video clips. Is there any effective algorithm? Thanks, |
|
s********1
发帖数: 581 | 50 谁能推荐有关算法(computation algorithm)的书籍？
使用的语言包括C, C++, C#, FOTRAN, 或者JAVA。 记得有一本书好叫做"...Numerical
Recipes", 不晓得书名对不对？适用哪种语言？书中是否带有光盘程序？
还有其他的书可以推荐吗？ |
|
