|
Can anyone help me work out a solution to this?
I have 15 different number, lets call these num1,num2,num3,num4 etc..
I want to be able to select the 5 largest numbers out of the 15.
There must be some methodical way to search through and compare the values to get the 5 largest.
Any ideas?
Cheers for your help.
|
|
|
|
|
The easy way (not the most efficient one!): sort the entire input collection, then
throw away all but the top 5.
The less expensive way: create an output collection, initially empty.
loop over all items in your input collection; compare them to the output collection,
if fewer than 5 items, add; if not, compare; if larger than the smallest, remove smallest and
add new one, otherwise skip. For best performance keep the output collection sorted all the
time.
Luc Pattyn [Forum Guidelines] [My Articles]
this weeks tips:
- make Visual display line numbers: Tools/Options/TextEditor/...
- show exceptions with ToString() to see all information
- before you ask a question here, search CodeProject, then Google
|
|
|
|
|
Are you sure the overhead of continually resorting the output collection is less than just sorting the main list once?
--
If you view money as inherently evil, I view it as my duty to assist in making you more virtuous.
|
|
|
|
|
Actually you don't need to keep the output collection sorted, I was wrong there,
the only thing that matters is only the smallest item gets replaced, so a single compare
pass suffices, which means at most 10*5 compares.
Luc Pattyn [Forum Guidelines] [My Articles]
this weeks tips:
- make Visual display line numbers: Tools/Options/TextEditor/...
- show exceptions with ToString() to see all information
- before you ask a question here, search CodeProject, then Google
|
|
|
|
|
If you need to output many items, you should use a heap to efficiently remove the smallest item. That way you get O(n lg m). (n = number of input items, m = number of output items)
|
|
|
|
|
I agree for sufficient output size there is a tree-based optimum somewhere in the middle of
the SortedList and the ArbitraryList; unfortunately .NET does not provide such MinHeap.
Luc Pattyn [Forum Guidelines] [My Articles]
this weeks tips:
- make Visual display line numbers: Tools/Options/TextEditor/...
- show exceptions with ToString() to see all information
- before you ask a question here, search CodeProject, then Google
|
|
|
|
|
At others replyed you can sort the array and then extraxt the maxs, this in 2 step. But the faster way depends probally on the length of your data array and on the number of extractions: in your case this numbers are 15 and 5, I think that you can fastly sort the array, so then it is probally a good idea to do this. But in the case of 100 and 3 probally you can find a faster way without sort the array and find directly the greather 3 numbers.
So, I want only to tell you a different way to solve this:
1) find the min value (minV)
2) find the max value and its index (maxV1, idxV1) then save it somewhere
3) replace maxV1 with minV in the original array
4) find the max value, so: maxV2 and idxV2, then store maxV2 somewhere and replace it with minV in the array
5) do this again and again...5 times
Probally this way can be faster on longer array (like 100) because in this way you have to read data from the array less times then to sort it
Russell
|
|
|
|
|
I need some help programming my own magic square in matlab without using the magic function my input should look something like this : [a b]=my_magic(5,10,4,3) and the out put of a should look like a 5x5 matrix with ten starting at row 4 column 3 and b should spit out the sum
Thank You
Rami
|
|
|
|
|
Here you can find the algorithms.
There are 3 different way according to the order of the square: magic square of odd order, magic square of even order and magic square of 4x order.
http://en.wikipedia.org/wiki/Magic_square[^]
Russell
|
|
|
|
|
FRACTAL FORMULAS
Hey folks!
I am hoping to experiment with some simple fractal formulas in VB. I have some running ok, but some
I seem to be having trouble with. I am using VB 4.0, and am hoping someone out there in cybertopia
might be able to share insights or code snippets? I don't need anything fancy like complex graphic
rendering of the fractals, although if you are excited about this stuff and feel ambitious I'm happy to
check out any graphic stuff you might want to share.
Simply, all I'm looking for is simple number in and number out routines, i.e. you stick a number(s)
into the formula, set the iteration ceiling and then watch what ever numbers get pumped out, thats it really.
So we might have say two text boxes for inputs,
textbox1 = any number value, i.e. 129
textbox2 = any number value, i.e. 234
Then we feed those values into the fractals formula loop and for every interation the newly generated
values get dumped to some other textbox.
=================
Barry Martin - Hopalong
This one is probably one of the most interesting ones, it seems Barry Martin released a really old dos version called hopalong
and there are various exe takes on this floating about, but most of them don't work anymore because they are so old.
I had trouble with this one because I don't really understand the "sign" function, and the VB 4 sign function doesn't seem
to work in a way thats compatible with the formula, but then I'm just as likely ignorant of how to properly apply it.
2 plots resemble organic structures like cells
xnew=y-sqrt (abs(b*x-c))sign(x)
ynew = a-x
different values for constants a,b,c give different patterns and periodicities
========
For the Lorentz function, I'd like to get a really simple rudimentary one working, but I'm also curious about what would happen
if we had two parallel Lorentz functions working together, one accepting outputs from the other and then feeding back into the first one,
i.e.
Lorentz function (1) outputs cycle iteration values to Lorentz (2)
And then Lorentz(2) inputs to Lorent(1) and so on.....
By the way, does anyone know if a single Lorentz function can operate on more than the default # of inputs
Lorentz Function
xnew = x+d*a*(y-x)
ynew = y+d*(x*(c-2)-y)
znew = z+d*(x*y-b*z)
where a,b,c,d are contants, i.e. values of 10,8/3,28,0.003
========
I tried coding this one also, but instead of getting a rich set of chaotic values all I got were two values
that repeated exactly the same over and over again????
Mandlebrot
z ; iterate via ; z^2 + c
==========
For this one I tried implementing this but for some reason, when I coded this to VB, it only generated
the same values over and over again.... no chaotically generated values......
(folds and remaps oval onto itself
)
Michael Henons;
Germaine to stellar orbits
xnew = y + 1 - 1.4 * x^2
ynew = 0.3 * x
|
|
|
|
|
cyndy_northrup wrote: I tried coding this one also, but instead of getting a rich set of chaotic values all I got were two values
that repeated exactly the same over and over again????
cyndy_northrup wrote: For this one I tried implementing this but for some reason, when I coded this to VB, it only generated
the same values over and over again.... no chaotically generated values......
Your problem seems to be a problem to update the old values with the new ones found:
cyndy_northrup wrote: xnew = y + 1 - 1.4 * x^2
ynew = 0.3 * x
are you updating x and y?
'step 1:
xnew = y + 1 - 1.4 * x^2
ynew = 0.3 * x
'store xnew,ynew somewhere
x=xnew;
y=ynew;
'goto step 1
Russell
|
|
|
|
|
yes!
unfortunatelty, i cant seem to get vb to do this properly it just repeats the same numbers?
|
|
|
|
|
ok, but it could be acceptable that the numbers repeats itself, it is only a sequence.
If you want to draw the images related to the fractals I'm thinking than you are not on the right way:
take the mandelbrot formula z(n+1)=z(n)^2+c
you do not have to prepare the sequence of z to draw the image, you have to study its convergence!
Fixing c, start from z=0 then you have to see if z(n) will escapes to infinity. You have to do this for many values of c (complex).
The image is only the real and imag part of c and the color is the first value of n that gives |z(n)|>2.
All this is true if my memory is well working
Russell
|
|
|
|
|
I don't know what your problem is, and I am not going to cover all those fractals.
Mandelbrot needs complex numbers (z = z*z + c needs a complex z and a complex c);
and the Mandelbrot set requires you iterate this formula with some constant c, a
variable initial value z0 of z (that's the point on the drawing), and then you calculate
how many iterations it takes to satisfy abs(z)>=2 to determine the "height" or color
of point z0.
There are several articles on Mandelbrot here on CodeProject; maybe on the others too.
The basic info probably is available on Wikipedia, if not just Google.
BTW: fractals make most sense when you plot them, just showing some numbers is
hiding their beauty for sure.
Luc Pattyn [Forum Guidelines] [My Articles]
this weeks tips:
- make Visual display line numbers: Tools/Options/TextEditor/...
- show exceptions with ToString() to see all information
- before you ask a question here, search CodeProject, then Google
|
|
|
|
|
i have a 16 bit variable(unsigned short).
now i want a best algorithm (function) which will do the following.
1.if contiguous bits at LSB are high then the function should return 1.
for example, consider the following bit patterns
0000000001111111
or
0000111111111111
or
0000000000000001
2.if continuous bits at MSB are high then the function should return 2.
for example,
1110000000000000 and so on.
3.other wise it should return 0 for the examoples such as
1010000000000011
0000011101010011 and so on
thanks in advance.
any more clarifications required, please get back.
|
|
|
|
|
Test the int with this constant variables if you want to not use a for loop with SHIFTs and bit-comparing.
To return 1:
1111111111111110
1111111111111100
1111111111111000
...
1100000000000000
1000000000000000
to return 2:
0000000000000001
0000000000000011
...
0111111111111111
else return 0
Russell
|
|
|
|
|
There might be some nifty bit processing, but this should work with no more than about 6 comparisons (32 bits - 62 options)
8-bit version:
int fn(int x)
{
switch (x)
case 0x01:
case 0x03:
case 0x07:
case 0x0F:
case 0x1F:
case 0x3F:
case 0x7F:
return 1;
case 0x80:
case 0xC0:
case 0xE0:
case 0xF0:
case 0xF8:
case 0xFC:
case 0xFE:
return 1;
default:
return 0;
}
I think compilers are quite good at optimizing this sort of code, but I have never tested it so I'd be interested in comments.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
thanks,
the above logic is simple and works as of now.
but the ultimate goal is to design a function in the following prototype.
int GetWordStatus(int word,int word length)
{
//code here
}
if the word length is certainly 8 or 16 or 32, then teh above logic is appropriate.
but the checking has to be done on the first specified number of bits. i.e. wordlength.
hope i dont need to give any example,
if required, i can.
thanku.
|
|
|
|
|
You should be able to extend this - do something like:
const int hi1 = {0xFF, 0xFE, 0xFC, 0xF8, 0xF0, 0xE0, 0xC0, 0x80, 0};
int GetWordStatus(int word, int wordlength)
{
ASSERT(wordLength <= 8 && wordLength >= 0);
int x = word & ~hi1[wordLength];
switch (x)
{
case 0x01:
case 0x03:
case 0x07:
case 0x0F:
case 0x1F:
case 0x3F:
case 0x7F:
return 1;
}
x = word | hi1[wordLength];
switch (x)
{
case 0x80:
case 0xC0:
case 0xE0:
case 0xF0:
case 0xF8:
case 0xFC:
case 0xFE:
return 2;
}
return 0;
}
It may be a bit inefficient for small wordlengths, if it is a problem you should spend some time and make it better.
-- modified at 6:57 Monday 3rd September, 2007
The reason I am suggesting a switch statement rather than a loop is that I thought the reason that in C/C++ the case values had to be constants was so that the compiler could order them and implement the switch as a simple binary search, so for N case statements there would be only log2(N) comparisons. I can't easily find a reference for this now - does anyone know if this happens?
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
cp9876 wrote: I can't easily find a reference for this now - does anyone know if this happens?
Try to look the disassembly window opening it to the code you suggested ...
I think that this shortcut is applyed from the compiler only if the number of case is greather then a specified number ... and only if you turn on that optimizations that is probally related with faster applications, but not applyed in small exe file dimension.
Russell
|
|
|
|
|
In this case I think that the better solution is a general solution...so a loop like
tmpword=word;
for(i=0;i<wordlength;i++){
if(tmpword == 1) return 1;
if(tmpword & 1 ) tmpword >>=1;
else break;
}
tmpword=word;
for(i=0;i<wordlength;i++){
if(tmpword == 0x80) return 2;
if(tmpword & 0x80 ) tmpword <<=1;
else break;
}
return 0;
or somethig similar to this
(I haven't tested the code...it is only an idea of what I'm meaning above... )
Russell
|
|
|
|
|
try this vb code:
Private Function GetWordStatus(ByVal word As Integer) As Integer
Dim significantLength As Integer = (word & "").Length
'Calculate significant Length of number
Dim temp As Integer
temp = (2 ^ significantLength) - 1
If Convert.ToInt64(word, 2) = temp Then
Return 1
Else
Dim cntr As Integer
temp = 2 ^ (significantLength - 1)
cntr = (significantLength - 1)
While cntr > 1
If Convert.ToInt64(word, 2) = temp Then
Return 2
Else
temp += 2 ^ (cntr - 1)
End If
cntr = cntr - 1
End While
End If
' Return 0
End Function
Its not the best but an alternative
Any systematic work reflects its significance for a long time. So let's discuss the best...
|
|
|
|
|
Hi,
it is much simpler than that.
one spec is missing: what if input is zero ?
THEORY (assume unsigned integers)
1.
if all zeroes followed by all ones, then one more becomes a power of two
2.
if all ones followed by all zeroes, then bitwise complement reverts to first case
3.
a power of two has just one bit set; it can be tested in one line:
if (( x & (-x) )==x) then either x = zero or x = power of 2 !!!
CODE
if (x==0) return whatever you think is appropriate
if ((x&(-x))==x) return 1;
x=~x;
if ((x&(-x)==x) return 2;
return 3;
Luc Pattyn [Forum Guidelines] [My Articles]
this weeks tips:
- make Visual display line numbers: Tools/Options/TextEditor/...
- show exceptions with ToString() to see all information
- before you ask a question here, search CodeProject, then Google
|
|
|
|
|
You won
Russell
|
|
|
|
|
I knew there would be a clever bit twiddling answer to this - very neat!
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
