I have 2 functions to get the n-th fibonacci number. The 1st one uses recursive calls to calculate the power(M, n), while the 2nd function uses iterative approach for power(M, n). Theoretically (at least what I think), they should have the same speed O(log n), but why when I run both, the 2nd one...
I am total beginner in C and after reading K&R's chapter 5, I felt I was ready to at least make a simple game using C. I know linked-lists, so since I was making an implementation of Snake, why not?
main.h
#include <SDL2/SDL.h>
#ifndef MAIN
#define MAIN
#define SCREEN_WIDTH 640
#define SCREEN...
I've written a code to check whether a list contains a sub-list or not. Here s is a sub-list and l is a list. While looking on the internet, I found only long codes for this problem. My code is short, but it works. Is there any issue with this code or can I improve my code further?
def is_Sublis...
Abit of context here, this is problem set 1 from edX CS50 introduction to computer science. The objective is to implement Luhm's Algorithm to detect the type of card input by the user.
The code meets all the criteria and objectives of the problem set, however when I run check50, it only returns...
Project Euler Problem 8 : https://projecteuler.net/problem=8
Here is my code in C to solve the problem.
#include <stdio.h>
#include <stdlib.h>
double find_max(int *arr){ //algorithms to find the greatest products of 13 adjacent digits
int i,j; //I use double and not long long b...
(define or-l (lambda x
(if (null? x)
#f
(if (car x) #t
(apply or-l (cdr x))))))
(map (lambda (x) (apply or-l x)) '((#t #t) (#f #t) (#t #f) (#f #f)))
'(#t #t #t #f)
It will be used in a function that evaluates Boolean e...
I have a question about my Code Review Stack Exchange post: check50 returns errors when code runs as expected
Abit of context here, this is problem set 1 from edX CS50 introduction to computer science. The objective is to implement Luhm's Algorithm to detect the type of card input by the use...
I am developing an application in C# using EF Core. I'm trying to stick to MVVM and bring all the logic and database interactions to the services.
Example of my service code:
public class SomeService : ISomeService
{
private readonly SomeContext context;
public SomeServ...
Question :
input: dict = {
"Key1" : "1",
"Key2" : {
"a" : "2",
"b" : "3",
"c" : {
"d" : "3",
"e" : {
"" : "1"
}
}
...
I m creating news columns according to others columns values but I need them to be filtered before doing so, I can probably add an ifelse in the mutate to avoid the filter but It will get the code quite unreadable...
So after all the filters I add columns for each subset then I aggregate them aga...
I have made a custom react hook, based on this SO question, which will be used in several functional components. It makes some calls to the server on mount to check if the order has been paid. If yes, paid state is set to true , and a file is being downloaded. On submit I check if paid state is s...
I've coded up a Vector class for use in my simulation support code, which I offer up for review.
I decided to extend std::array. Now, I know that std::array is an aggregate type, but with C++-17 we can now extend an aggregate base type and still use 'curly brace' initialization. Extending std::...
I have the following two methods which kind of do the same thing as follows,
private UpdateResponse getUpdateResponseWhenNoUpdatesAreAvailable(UpdateRequest updateRequest) {
String productName = updateRequest.getProductName();
String productBaseVersion = updateRequest.getProd...
I've been meaning to revisit this old code for a long time, and this week finally ended up doing it. The resulting code is on GitHub, and for full context and disclosure I wrote a blog article about this exercise in OOP design.
The idea is to abstract away the pain of making secure ADODB queries...
I need to fill out a vector with values from a .txt file. Right now, I'm doing it like this:
fstream read;
read.open("file.txt", ios::in);
// ...
vector<string> line;
for (int j = 0; j < 5; j++)
{
string current;
read >> current;
line.push_back(current);
}
Is there a way to omit ...
I had to solve three problems on graph theory that I solved by implementing a utility function and 3 functions, one for each of the problems.
The problem set defines the input for all my functions as a E+1 x 2 matrix (they call this an edge list) where the first row V E contains the number of ve...
#include<linux/init.h>
#include<linux/kernel.h>
#include<linux/param.h>
#include<linux/types.h>
#include<linux/list.h>
#include<linux/module.h>
#include<linux/atomic.h>
#define MAX_COUNT 4
#define EMPTY 0
struct data_t
{
int data;
};
struct entry_t
{
struct data_t data;
...
I've got a task to create a readline() function that would have the exact same behavior as read():
ssize_t read(int fd, void *buf, size_t count); (man read)
So it should return -1 on error and number of bytes read on success.
Also, if the function receives a string with multiple \n chars, it s...
I faced a series of problems when unit testing a tool of mine that generates files. They were caused by me putting the files in the same temporary folder and the tests running in parrallel.
As a result I created this simplistic class that handles the creation and deletion of a temporary folder. ...
I wrote the following code to combine two queries (getBlogFeedPosts & getRegCatPosts). They are given values passed in from 'mbaConfig' on which posts to show based on user selection on the front-end.
$paged = (get_query_var('paged')) ? get_query_var('paged') : 1;
$olderPage = $paged + 1;
...
