#include<stdio.h> #include<stdbool.h> struct node { int data; struct node* next; }; bool searchNode(struct node** head_ref,int key) { struct node* current=*head_ref; while(current!=NULL) { if(current->data==key) return true; current=current->next; } return false; } int main() { struct node* node1=(struct node*)malloc(sizeof(struct node)); struct node* node2=(struct node*)malloc(sizeof(struct node)); struct node* node3=(struct node*)malloc(sizeof(struct node)); node1->data=100; node2->data=200; node3->data=300; node1->next=node2; node2->next=node3; node3->next=NULL; struct node* head=node1; searchNode(&head,node3); } This is my code it has no output, Why? Is there anyone to help me with this code?

Never heard before 🤔

Returning raw owning pointers is bad, but do you think it's OK to do so when the function's only purpose is to be consumed by a function take takes ownership? So: 1) Function create returns owning raw pointer 2) Function set accepts an owning raw pointer and assumes ownership. I can't modify this function. if I were to make create return unique_ptr, it would look like: std::unique_ptr<Foo> ptr = create(...); model.set(ptr.release()); (or put it in one line, doesn't matter) However I feel like this is just fanfare to keep with ownership safety and distracts from the actual purpose of the function - it's called in this one place and this one place only.

#include <Stdio.h> int main() { char x; while((x=getchar()!='\n')) if((x>='a'&& x<='z')(x>='A' && x<='Z')) { x=x+4; if((x>'z'&& x<='z'+4)(x>'Z'&&x<='Z'+4)) x=x-26; } printf("%c",x); return 0; }

#include <Stdio.h> int main() { char x; while((x=getchar()!='\n')) if((x>='a'&& x<='z')(x>='A' && x<='Z')) { x=x+4; if((x>'z'&& x<='z'+4)(x>'Z'&&x<='Z'+4)) x=x-26; } printf("%c",x); return 0; }

https://onlinegdb.com/ZRFUkmwN0 Good evening, sorry to bother you. I hope someone will help, my teacher in college said that the functions are parts of the object, so the object itself does not need to be passed to them. But I don't understand how it should work then (if it's not difficult for someone, at least explain it to me on the example of my input function). Any help or advice

Input two numbers (k and c) and calculate the value of y for x = 0.1, 1, 5 where y = kx + c

Input two numbers (k and c) and calculate the value of y for x = 0.1, 1, 5 where y = kx + c

Maybe this is what you looking for: before i will not using input instead i will give you example using it with defined var

i mean what happens when it is executed

#include<stdio.h> int main() { float k = 1;float c = 2;float y= 0; float x[3] = {0.1,1,5}; for (int iter = 0;iter < 3;iter++) { k *= x[iter]; } y = k + c; printf("%.2f",y); }

#include<stdio.h> int main() { float k = 1;float c = 2;float y= 0; float x[3] = {0.1,1,5}; for (int iter = 0;iter < 3;iter++) { k *= x[iter]; } y = k + c; printf("%.2f",y); }

Just a little correction.. #include<stdio.h> int main() { float k = 1;float c = 2;float y= 0; float x[3] = {0.1,1,5}; for (int iter = 0;iter < 3;iter++) { k *= x[iter]; y = k + c; printf("%.2f\n",y); K=1; } return 0; } Notice the scope..

Try to use || or && in if condition

Sure, but why sending this to me? :)

when in assembly you execute the int instruction is it like when you call a function

Returning raw owning pointers is bad, but do you think it's OK to do so when the function's only purpose is to be consumed by a function take takes ownership? So: 1) Function create returns owning raw pointer 2) Function set accepts an owning raw pointer and assumes ownership. I can't modify this function. if I were to make create return unique_ptr, it would look like: std::unique_ptr<Foo> ptr = create(...); model.set(ptr.release()); (or put it in one line, doesn't matter) However I feel like this is just fanfare to keep with ownership safety and distracts from the actual purpose of the function - it's called in this one place and this one place only.

Object is just a struct and a set of function with implicit object passing. Like class A {foo()} equal to foo(A* this)

#include <stdio.h> int main() { int a[10]; int i,sum=0,aver,num; for(i=1;i<10;i++) { scanf("%d",&a[i]); sum=sum+a[i]; } aver=sum/10; for(i=0;i<10;i++) { if(a[i]>aver) num++; } printf("%d",num); return 0; }

In the 2nd loop just print a[ i ] Do not increment it

#include <stdio.h> int main() { int a[10]; int i,sum=0,aver,num; for(i=1;i<10;i++) { scanf("%d",&a[i]); sum=sum+a[i]; } aver=sum/10; for(i=0;i<10;i++) { if(a[i]>aver) num++; } printf("%d",num); return 0; }

You forgot to initialize num and aver

But I need to output the number of numbers greater than the average🥲

#include <bits/stdc++.h> using namespace void printPattern(int radius)   float dist;   for (int i = 0; i <= 2 * radius; i++) {           for (int j = 0; j <= 2 * radius; j++) {       dist = sqrt((i - radius) * (i - radius) +                   (j - radius) * (j - radius));                if (dist > radius - 0.5 && dist < radius + 0.5)         cout << "*";       else         cout << " ";          }       cout << "\n";   } }   int main() {   int radius = 6;   printPattern(radius);   return 0; }

But I need to output the number of numbers greater than the average🥲

how to loop in 2D array using function!? I got this array ... when I compile the file I got a lot of errors! int arr(int value, int nums[][], int rows, int cols) { int i = 0, j = 0; for (; i < rows; i++) { for (; j < cols; j++) { if (nums[i][j] == value) return nums[i][j]; } } } and this is my main function: #include <iostream> int main() { int numbers[2][3] = {{1,2,3}{1,2,3}}; std::cout << arr(8, numbers, 2, 3) << endl; }

how to loop in 2D array using function!? I got this array ... when I compile the file I got a lot of errors! int arr(int value, int nums[][], int rows, int cols) { int i = 0, j = 0; for (; i < rows; i++) { for (; j < cols; j++) { if (nums[i][j] == value) return nums[i][j]; } } } and this is my main function: #include <iostream> int main() { int numbers[2][3] = {{1,2,3}{1,2,3}}; std::cout << arr(8, numbers, 2, 3) << endl; }

Hello!?

Hello. Specify int nums[][3] in function definition and add comma between braces in array initialization

Thank you I will do it 👍🏼

Hello!?

i think because when another program calls yours, it is used to confirm that everything worked correctly

how to loop in 2D array using function!? I got this array ... when I compile the file I got a lot of errors! int arr(int value, int nums[][], int rows, int cols) { int i = 0, j = 0; for (; i < rows; i++) { for (; j < cols; j++) { if (nums[i][j] == value) return nums[i][j]; } } } and this is my main function: #include <iostream> int main() { int numbers[2][3] = {{1,2,3}{1,2,3}}; std::cout << arr(8, numbers, 2, 3) << endl; }

Is it wrong to right something inside of string part of scanf like sacnf("%d. \n", &num) I'm wondering why online gdb does not give any error.

It's correct, you can learn more about the format string parameter of scanf here: https://en.cppreference.com/w/c/io/fscanf

You didn't put array[ ] in function declaration

can someone help me with my arraylist assignment pls

Did I see someone promoting hot garbage of a book?

@K11M1 can u message you? i really need your help

hello! i'm remaking a board game in c, and since the game is deterministic i wanted to find the optimal moves given the state of the game. what i want to do is to build a tree (not a binary tree though) of all the moves one can make during a turn and subturns that may appear i know that the max amount of choices of moves is 6 this is (vaguely) what i am currently doing: typedef struct StateNode { Board board_state; struct StateNode* paths[6]; } StateNode; are there any better options/better practices for this?

how to loop in 2D array using function!? I got this array ... when I compile the file I got a lot of errors! int arr(int value, int nums[][], int rows, int cols) { int i = 0, j = 0; for (; i < rows; i++) { for (; j < cols; j++) { if (nums[i][j] == value) return nums[i][j]; } } } and this is my main function: #include <iostream> int main() { int numbers[2][3] = {{1,2,3}{1,2,3}}; std::cout << arr(8, numbers, 2, 3) << endl; }

int *fun(int *value, int *nums[100][100], int rows, int cols) { int i = 0, j = 0; for (; i < rows; i++) { for (; j < cols; j++) { if (nums[i][j] == value) { return nums[i][j]; } } } }

hello! i'm remaking a board game in c, and since the game is deterministic i wanted to find the optimal moves given the state of the game. what i want to do is to build a tree (not a binary tree though) of all the moves one can make during a turn and subturns that may appear i know that the max amount of choices of moves is 6 this is (vaguely) what i am currently doing: typedef struct StateNode { Board board_state; struct StateNode* paths[6]; } StateNode; are there any better options/better practices for this?

You mean like that tic-tac-toe game right? It uses the Minimax algorithm.

no, not tic-tac-toe