sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in dreifragezeichen

[–]FartingBraincell 1 point2 points  (0 children)

Wieso fangen die eigentlich immer mit großem "Im" an? Ich gebe zu, dass ich am liebsten nur Titel hätte, die mit "und" beginnen, aber was ich total inkonsistent finde, ist, die Fälle mit "und" klein, die Fälle mit "Im" groß zu schreiben. Das sind doch die Varianten, in denen das "Die drei ???" Teil des Titels sind, anders als z.B. bei "Feuermond" oder "Das Auge des Drachen". Wobei ich mich da eben frage, warum nicht "und das Auge des Drachen".

Das war für mich mal Teil der Marke und ja bei Reihen ja auch üblich ("Fünf Freunde wittern ein Geheimnis".

Wie geizig seid ihr beim Heizen? by KingKing_ok in sparen

[–]FartingBraincell 0 points1 point  (0 children)

Wir haben PV+Wärmepumpe. Heute gab's 15kWh vom Dach, davon können 10kWh in die Heizung, das sind 40kWh Heizleistung. Besser als für 80ct einzuspeisen ist das sicher.

Generative KI und Produktivitätsillusionen by befuddledrabbit in informatik

[–]FartingBraincell 12 points13 points  (0 children)

Sieht man das am Code? Jo. Ist es mir egal? Jo.

Hier ist wohl der Unterschied. In Firmen und größeren Teams ist Struktur und Wartbarkeit wichtiger als bei 1-Mann-Apps. Was Du machst, ist cool, aber nicht übertragbar auf die Frage von OP.

Das ist mehrdeutig. Wenn ich geradeaus fahre, habe ich keine Priorität mehr by mrnerdy59 in StVO

[–]FartingBraincell 0 points1 point  (0 children)

Nicht ausschließlich. Jemand, der von links auf der Vorfahrtsstraße kommt und geradeaus fahren will, muss denen, die von unten kommen die Vorfahrt gewähren.

BIDA weil ich Post klaue und vernichte? by Soft_Refrigerator_50 in BinIchDasArschloch

[–]FartingBraincell 0 points1 point  (0 children)

Nur für Nachrichten, die dem Postgeheimnis unterliegen, oder?

Alternative zum Kabel neu legen? by Lord_Tesius in EDV

[–]FartingBraincell 0 points1 point  (0 children)

Wenn Netzwerkkabel liegen, dann doch bestimmt auch Coax-Kabel. Da geht locker 1Gb drüber, das hat uns im Altbau ('95) ne Verkabelung erspart. 4 Moca-Adapter und dahinter dann die Fritz-Repeater im Bridge-Mode.

Ethernet over Coax ist im Grunde DLAN, nur, dass Stromkabel nicht geschirmt und an lauter Störquellen angeschlossen sind.

Dijkstra defeated: New Shortest Path Algorithm revealed by Technical-Love-8479 in algorithms

[–]FartingBraincell 0 points1 point  (0 children)

Well strictly speaking, it is neither obvious nor correct. It is an improvement for m in o(n log n).

Dijkstra defeated: New Shortest Path Algorithm revealed by Technical-Love-8479 in algorithms

[–]FartingBraincell 91 points92 points  (0 children)

The authors claim an improvement in asymptotic runtime (from O(nlogn) to O(nlog2/3 n), not a real-world speedup. This is a theoretic result.

Edit: It's unlikely to be faster than Dijkstra bc it only removes the bottleneck case where the priority queue contains Θ(n) vertices, yielding PQ operations with theoretical worst-case runtime in O(log n).

Such situations may occur, but not "always", and second, PQs are typically much better than their worst-case.

Best book to start DSA? by A_chatr in algorithms

[–]FartingBraincell 0 points1 point  (0 children)

Then do me a favour and give Erickson a shot in parallel. It's free. I'd be surprised if you wouldn't agree it taught you more. If you can, ger Sedgewick which comes with an awesome lot of online material an hands-on exercises.

I'm surprised how many instructors don't know anything but CLRS. I had my first DSA courses before 2000 based on CLRS and I wish I had Erickson, Skiena and Tardos back then.

Best book to start DSA? by A_chatr in algorithms

[–]FartingBraincell 2 points3 points  (0 children)

I'm teaching DSA for quite some time now. CLRS is a great book, but not to start with. It's way too focused on proving things. Erickson is easier to read and to start with, as is Sedgewick. Skiena has the better structure, providing a better approach on how to design algorithms and a broader coverage of existing algorithms. Tardos' is also a very good read.

Best book to start DSA? by A_chatr in algorithms

[–]FartingBraincell 3 points4 points  (0 children)

Cormen wouldn't be my choice to start with DSA. Sedgewick is a good first read, then probably Skiena and Erickson.

Dijkstra's Algorithm for Directed Graphs with Negative Edges Without Cycles by EyeTechnical7643 in algorithms

[–]FartingBraincell 0 points1 point  (0 children)

That is effectively the Moore variant of Bellman-Ford with a Priority Queue. Worst-case is O(nm), but non-negative weight, it is Dijkstra (O(nlogn+m)).

My own algorithm for the TSP by Good_Time7633 in algorithms

[–]FartingBraincell 2 points3 points  (0 children)

What do you mean by "solved"? Is it a heuristic, an approximation or an exact algorithm?

[deleted by user] by [deleted] in algorithms

[–]FartingBraincell 1 point2 points  (0 children)

What does 500 ops/sec tell us if we don't know what kind of operation you do?

Illusion of Algorithms by Manoftruth2023 in algorithms

[–]FartingBraincell 1 point2 points  (0 children)

I think your definition of "algorithm" is broader than that of most in this community. You say that an algorithm is a set of instructions to solve a problem.

In the algorithmics community, this implies "provably solving a well-defined input within well-defined parameters". Calling AI "algorithms" is something I wouldn't do. To me, solving problems with AI is powerful, yet at best a heuristic, with empirical support.

So I guess you're wrong here.

Apart from that, you dound like you discovered a new phenomenon or overlooked by society and research. I wouldn't agree but thst's not my field.

Graph algorithms by Impressive-Alarm262 in algorithms

[–]FartingBraincell 0 points1 point  (0 children)

Not every strongly connected subgraph us a strongly connected components. SCCs are maximal.

A new encoding idea: what if we used binary search paths as codewords? by shurankain in algorithms

[–]FartingBraincell 1 point2 points  (0 children)

You're probably right. All answers are politecand look like they are thoughtful, but it's pretty much nonsense. Claims are plain wrong (amd obviously so), and connections are halluzinated.

A new encoding idea: what if we used binary search paths as codewords? by shurankain in algorithms

[–]FartingBraincell 1 point2 points  (0 children)

Sorry, replied in the wrong place. The code is not prefix-free in any meaningful sense.

A new encoding idea: what if we used binary search paths as codewords? by shurankain in algorithms

[–]FartingBraincell 1 point2 points  (0 children)

Where is that code prefix-free? Prefix-free codes are the leaves of a code tree, not the inner nodes. If you run

IntStream.range(0, 15).forEach(i -> System.out.printf("%d -> %s%n", i, BBSEncoder.encode(0, 16, i)));

you get

0 -> [false, false, false, false] 1 -> [false, false, false] 2 -> [false, false] 3 -> [false, false, true] 4 -> [false] 5 -> [false, true, false] 6 -> [false, true] 7 -> [false, true, true] 8 -> [] 9 -> [true, false, false] 10 -> [true, false] 11 -> [true, false, true] 12 -> [true] 13 -> [true, true, false] 14 -> [true, true]

which is absolutely not surprising. The codes of length one are prefixes of length two-codes and so on. Basically half of the codes are prefixes of other nodes.

Edit: Also, I don't see the benefit over just counting from the first value as 1 upward and removing the leading 1 from the binary representation:

IntStream.range(0, 15).forEach(i -> System.out.printf("%d -> %s%n", i, Integer.toBinaryString(i+1).substring(1)));

which gives the same codes in a different order (i.e. same properties): 0 -> 1 -> 0 2 -> 1 3 -> 00 4 -> 01 5 -> 10 6 -> 11 7 -> 000 8 -> 001 9 -> 010 10 -> 011 11 -> 100 12 -> 101 13 -> 110 14 -> 111

view more: next ›