#include <iostream> #include <stdlib.h> #include <stdio.h> using namespace std; //Node Class class Node { private: int data; Node next, prev; public: int get(){ return data; } void set(int a){ data = a; } Node*...
SHJshaliniv and 3 more commentedSo, I have a background mostly in imperative languages and want to start with a functional language to learn the nuances of functional programming and probably use it in some projects in the future. Based on popularity, practicality and probable usef...
Join discussionIt's beautiful how the same problem can be solved using an iterative or a recursive algorithm, both having their own advantages and disadvantages. Personally, I first got familiarized with looping structures and was fairly comfortable thinking that w...
MAMHSMike and 5 more commentedI'm a tech lead, most of the team I work with have less than a year of experience. The business is quite demanding, my direct manager supervisor doesn't support me very well, and I am very much not interested in changing jobs at the moment. What I wo...
A2CLAnton and 3 more commentedI have a closure, and a function my_fun that does something with it (playground): pub trait Message { /* not important */ } struct MyMessage { /* not important */ } impl Message for MyMessage { /* not important */ } pub fn my_fun<Req, Resp, F>( ...
MCMarco and 1 more commentedWhat is the difference in performance in case of case 1 and case 2 var array = [1,2,3,4,5,7,788,9,234]; //case 1: array.forEach((element) => { // Some statements }) //case 2: array.map(() => { // Some statements })
Join discussion