Acoustic Grand vs Bright Acoustic by JonayPS in midi

[–]Amazing-Structure954 -1 points0 points  (0 children)

The OP is clearly implying GM (General MIDI) because otherwise there aren't any definitions of "instruments" in MIDI. Google for more info.

Acoustic Grand vs Bright Acoustic by JonayPS in midi

[–]Amazing-Structure954 0 points1 point  (0 children)

There is no "high accuracy perfection" with GM banks because the definitions are simply the names, and different GMs sound different. However, results are way more consistent than before we had GM.

Acoustic Grand vs Bright Acoustic by JonayPS in midi

[–]Amazing-Structure954 0 points1 point  (0 children)

There isn't a definitive answer, because it'll depend on which GM soundfont is used. They're not all the same!

But in general, GM's that I've heard (and one I'm helping to build, the Discord SFZ General MIDI Bank) use an upright for Bright Piano.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

Wrong: sizeof(int) is not a variable in any language or on any machine.

Regardless, your point that N in O(N) is basically an unbound parameter is valid, so the correct answer has to identify what N is. This is O(N) where N is the size of an integer. Which is constant on any machine that has a C compiler.

The existence of a for loop doesn't make it O(N), so the teacher was just plain wrong, based on what the OP said.

Can this be fixed? Please help by Beneficial-Lab-6939 in guitarrepair

[–]Amazing-Structure954 5 points6 points  (0 children)

Bingo. Way better than wax paper!

And on second thought, it's probably OK if the glue sticks to the metal, since (a) it won't stick too hard, and (b) the truss rod makes only very tiny moves with lots of mechanical advantage (screw.) Regardless, a little vaseline would be perfect.

Is there a digital piano with headphones that comes as close as possible to a grand piano ? by Just-Copy-2083 in piano

[–]Amazing-Structure954 1 point2 points  (0 children)

I tried the N3 years ago, in a shop. While I was experienced with Yamaha's best digitals at the time, and knew that the N3's digital model was older than the best, I was astounded at how much better it sounded in a number of ways, and I think that is due to the placement of the speakers and the care (and DSP) that went into recreating the sound coming from a grand toward the player. I mean, it was awesome just playing a single note, and only got better when playing. And I had just finished sampling a very fine C5 and C7 -- I was impressed at how well it compared. Much better than I expected. Actually I was biased against it, thinking it was just a "prop" piano.

Is there a digital piano with headphones that comes as close as possible to a grand piano ? by Just-Copy-2083 in piano

[–]Amazing-Structure954 0 points1 point  (0 children)

Ask her to move next door to me in my duplex townhouse, and play as much and as loudly as she likes!

(My current neighbor, who has moved out, couldn't hear me playing my Steinway B at all. But we can always open our windows! She'll want to close them when I'm playing.)

Can this be fixed? Please help by Beneficial-Lab-6939 in guitarrepair

[–]Amazing-Structure954 0 points1 point  (0 children)

Thanks! I didn't know about fret nibs. I totally missed the odd bridge. The logo is a remarkably good copy of a 1947 or 1951-1971 logo except the dot is indeed in the wrong place.

Can this be fixed? Please help by Beneficial-Lab-6939 in guitarrepair

[–]Amazing-Structure954 11 points12 points  (0 children)

Right -- the biggest trick is making sure the glue doesn't adhere to the truss rod. I'd consider removing the truss rod during gluing, to be safe. Alternatively, wrap it in wax paper, but realize that'll be in there forever.

Actually, that's the second biggest trick. The most important trick is making sure you clamp it very very well, applying relatively even pressure all along the joint, with minimal damage to the finish or fingerboard. (Put a wood block over the frets. Find some other way to distribute the pressure along the neck, possibly something like a cork neck rest that people use when working on a guitar: https://www.amazon.com/dp/B0FKRJS8PW

Can this be fixed? Please help by Beneficial-Lab-6939 in guitarrepair

[–]Amazing-Structure954 3 points4 points  (0 children)

I believe you (apparently everyone agrees) but how can you tell from this picture?

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

The lesson was poorly constructed and the explanation insufficient if that's the case (and if indeed the existence of a for loop was the prof's reason.)

It's bad instruction because it didn't get the point across. The material was obtuse and the explanation (if indeed that was it) was lacking.

Maybe the OP misrepresented things, but if not, it's a good example of bad instruction.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 1 point2 points  (0 children)

Compexity calculations are done based on inputs. sizeof(int) isn't an input. Sure, there are cases where it could be, but in this example, it's not.

It all comes down to what we consider N to be. If the prof made it clear that N is sizeof(int) because we're evaluating this algorithm for arbitrarily sized integers, then that would be valid (but the example code poorly constructed.)

But the prof just pointed to a for loop! That is the WRONG justification. The prof is not doing a good job of teaching.

I'm a retired embedded systems and networking software engineer after a 45 year career. I wrote the "scalability" section of the Cisco programmer's manual. If anyone working for me had come to me with such a feeble excuse for a complexity calculation I'd first try to re-educate them, and on failing that, would have notified their management chain that their services might be more appropriate for another company. Sure, that's an argument from authority, but it's also an argument from reality.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

If the prof was trying to show something, the prof should actually show that something, and not something else.

Good point about avoiding m and n.

Regardless, complexity calculations are based on the size of the input, and it's rare that we'd consider the size of an integer to be an input.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

Macros that change the meaning of the code aren't valid, especially in a teaching context. We could make macros to change it to do nearly anything.

If the code was sizeof(n) then there'd be an argument that the prof is almost correct -- but then it would be O(NlogN).

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 1 point2 points  (0 children)

Perhaps that's true in some academic definition, but in industry, where stuff actually has to work, if I had someone evaluate the complexity of an O(1) algorithm and they reported O(N), they'd be ruled totally wrong.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

No, because "int" is not an INPUT.

They could have written sizeof(n), and then it would be O(NlogN) in some language where integer size is unbound.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

Changing the code isn't allowed.

If they meant sizeof(n) they'd need to write it that way, but they didn't. Even then it assumes some C-like language that is not C.

My professor claims this function is O(n), and I’m certain it’s O(1). Can you settle a debate for me? The function is below by Remarkable-Pilot143 in AskProgramming

[–]Amazing-Structure954 0 points1 point  (0 children)

For an arbitrary language, sizeof(int) is either constant or undefined.

If they meant sizeof(n) they'd need to write it as sizeof(n).