Small Doubt on C

srestha asked Jul 27, 2017

237 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

Pawan Nirpal asked Oct 29, 2021

596 views

C-Programming doubt on operator precedence of prefix and postfix ++ with dereferencing operator *.
Operator precedence rule for prefix and postfix ++For C programming is the above mentioned article considered as standard, Is there any standard compiler or C standard that GATE follows for evaluation, and are there any more such exceptions, please do let me know?

Operator precedence rule for prefix and postfix ++For C programming is the above mentioned article considered as standard, Is there any standard compiler or C standard th...

Pawan Nirpal

596 views

Pawan Nirpal asked Oct 29, 2021

2 votes

1 answer

Venkat Sai asked Jan 17, 2018

536 views

DOUBT ON FUNCTION DECLARATION WITHIN A FUNCTION IN C
#include <stdio.h> int yellow(); int main() { int hello(); yellow(); printf("%d",hello()); return 0; } int yellow(){ hello(); } int hello() {printf("hello hello "); return 1; } HERE I ... yellow() but it compiles fine and outputs hello hello hello hello 1 ....are local delaration of functions globally scoped in C ??

#include <stdio.h>int yellow();int main(){ int hello(); yellow(); printf("%d",hello()); return 0;}int yellow(){ hello(); }int hello(){printf("hello hello...

Venkat Sai

536 views

Venkat Sai asked Jan 17, 2018

5 votes

1 answer

Tuhin Dutta asked Nov 14, 2017

1,435 views

Doubt on switch case labels in C
#include <stdio.h> int main() { int check = 20; const int arr[] = {10, 20, 30}; switch (check) { case arr[0]: printf("Tuhin "); case arr[1]: printf("Dutta"); case arr[2]: printf("TuhinDutta"); } return 0; } Please provide output.

#include <stdio.h>int main(){ int check = 20; const int arr[] = {10, 20, 30}; switch (check) { case arr[0]: printf("Tuhin "); case arr : printf...

Tuhin Dutta

1.4k views

Tuhin Dutta asked Nov 14, 2017

3 votes

1 answer

Pooja Palod asked Dec 5, 2015

1,998 views

Insertion sort on small arrays in merge sort
Although merge sort runs in Θ(n lg n) worst-case time, and insertion sort runs in Θ(n 2 ) worst-case time, the constant factors in insertion sort make it faster for small n. Thus, it makes sense to ... for which the modified algorithm has the same asymptotic running time as standard merge sort? d.How should we choose k in practice?

Although merge sort runs in Θ(n lg n) worst-case time, and insertion sort runs in Θ(n 2 ) worst-case time, the constant factors in insertion sort make it fast...

Pooja Palod

2.0k views

Pooja Palod asked Dec 5, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Small Doubt on C

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment