BinaryByter
one single _ isn't UB
BinaryByter
(what about my_snek_case_variable?)
Isaac
I don't get a meaning of this => iirc
BinaryByter
no
BinaryByter
not UB
Mihail
Ok
Mihail
@caasi8 if you missed this.
Isaac
Thanks
RoBin
RoBin
RoBin
Help me with this.
RoBin
Anyone knows coding ?
BinaryByter
no, we are not a coder group
BinaryByter
undefined behaviour
BinaryByter
you don't know what will happen
BinaryByter
it might do what you want
BinaryByter
but the compiler could also just write a nop
BinaryByter
or it might even add a division by 0
Isaac
ok it is good
BinaryByter
no, UB is very bad
BinaryByter
because what might work on one setup might not work on another setup
BinaryByter
Oh didn't realize that
Mihail
Did italic formatting
Nomid Íkorni-Sciurus
You know libs are made users, mostly, NOT people who design the language
Exactly: I would prefer having a library rather than writing it myself, because they would surely do a better work than I would.
Nomid Íkorni-Sciurus
Anyway, thanks for this discussion. I think that I'm just not experienced enough.
Ибраги́м
Exactly: I would prefer having a library rather than writing it myself, because they would surely do a better work than I would.
Really? U think every lib writer is "experienced" | "seasoned" ?
Dima
now think about npm packages/libraries
Dima
Ибраги́м
Good one Dima, Good one
14•08
Anonymous
Hey
Anonymous
I need a favor
Anonymous
Can anyone solve me a problem
Anonymous
PROBLEM : Quick Sort algorithm over a doubly linked list.
1. Define a structure for the doubly linked node, and define two global pointers named
“head” and “tail”.
2. Implement “insert_to_tail” function, that will insert a new node after the tail. You
MUST update tail during this function call.
3. Implement the function “quick_sort”, that will perform the sorting algorithm over the
linked list you constructed. For simplicity, use the first element as pivot. The function
MUST be recursive. The prototype is given below:
void quick_sort(struct node *begin, struct node *end);
Dima
What's your problem? if it is basic assignment there will be no help for you
Anonymous
It's not a basic assignment.
I can't solve this problem.
Anonymous
Segment tree ke node be value kya store kraye...
Anonymous
Anonymous
Node me kya dalu
Anonymous
For problem no 5 codechef challange
Isaac
How can I a fix this erro google have really not help me.
/include/class/../../include/class/algorithm.hpp:12:9: error: ‘Graph’ does not name a type
Graph::Graph * graph;
Isaac
// algorithm.hpp
#include <iostream>
#include "../../include/class/graph.hpp"
#include "../helper.hpp"
class AlgorithmAPI{
protected:
Graph::Graph * graph;
public:
// pure virtul function
AlgorithmAPI(Graph *);
virtual void run() = 0;
};
class BreadthFirstSearch: public AlgorithmAPI{ // algorithm interface
public:
void run();
};
class Dijkstra: public AlgorithmAPI{
public:
Dijkstra();
void run();
};
class Bellman: public AlgorithmAPI{
public:
Bellman();
void run();
};
class existPath: public AlgorithmAPI{
public:
void run();
};
#endif
Isaac
ok
Ибраги́м
// algorithm.hpp
#include <iostream>
#include "../../include/class/graph.hpp"
#include "../helper.hpp"
class AlgorithmAPI{
protected:
Graph::Graph * graph;
public:
// pure virtul function
AlgorithmAPI(Graph *);
virtual void run() = 0;
};
class BreadthFirstSearch: public AlgorithmAPI{ // algorithm interface
public:
void run();
};
class Dijkstra: public AlgorithmAPI{
public:
Dijkstra();
void run();
};
class Bellman: public AlgorithmAPI{
public:
Bellman();
void run();
};
class existPath: public AlgorithmAPI{
public:
void run();
};
#endif
What's the content of #include "../../include/class/graph.hpp" ?
Isaac
https://pastebin.com/Jtd0Vp77
Isaac
https://pastebin.com/daZe8v6g
Isaac
Anh I have done a circular inclusion
Isaac
Then i will try to fix it first I had not seen the circular inclusion
Ибраги́м
// algorithm.hpp
#include <iostream>
#include "../../include/class/graph.hpp"
#include "../helper.hpp"
class AlgorithmAPI{
protected:
Graph::Graph * graph;
public:
// pure virtul function
AlgorithmAPI(Graph *);
virtual void run() = 0;
};
class BreadthFirstSearch: public AlgorithmAPI{ // algorithm interface
public:
void run();
};
class Dijkstra: public AlgorithmAPI{
public:
Dijkstra();
void run();
};
class Bellman: public AlgorithmAPI{
public:
Bellman();
void run();
};
class existPath: public AlgorithmAPI{
public:
void run();
};
#endif
In
class AlgorithmAPI{
protected:
Graph::Graph * graph;
public:
// pure virtul function
AlgorithmAPI(Graph *);
virtual void run() = 0;
};
Change Graph::Graph * graph; to Graph * graph;
Isaac
I have alreay done it but it is not work
Ибраги́м
Graph::Graph mean:
- Second Graph is a member of first one which is not true in this case.
Isaac
Graph::Graph mean:
- Second Graph is a member of first one which is not true in this case.
yeah I am agree with you
Isaac
Have you seen the circular inclusion ?
Ибраги́м
I don't want to
Dima
it sounds like it isn't.
klimi
It's just very bad english I think
Dima
well, the rules are still alive
klimi
^^ yep
Nameful
I think it's a mixture of English and another language
Dima
that's cool, i guess
klimi
What a discussion
Nameful
Many languages lack words required for discussion regarding these kind of topics, so they use English for the missing words
Nameful
… so I would not call it English
Dima
Gibrish
Dima
did you mean 'regex'?