Click here to Skip to main content
14,271,492 members

Managed C++/CLI

 
AnswerRe: Real-Time push server in C++ may i use it as unmanaged dlls so i can work on it using C# ? Pin
John Schroedl5-Jan-18 14:27
professionalJohn Schroedl5-Jan-18 14:27 
QuestionC++/CLI and .Net Entity Framework Pin
SheepSpeech4-Dec-17 0:20
memberSheepSpeech4-Dec-17 0:20 
QuestionMessage Closed Pin
27-Nov-17 21:16
memberMember 1354502927-Nov-17 21:16 
AnswerRe: project $50 reward need in 24 hours Pin
Pete O'Hanlon27-Nov-17 21:18
protectorPete O'Hanlon27-Nov-17 21:18 
QuestionISSUE - TCP/IP sockets in MFC VS2017 Pin
D.Manivelan21-Nov-17 1:22
memberD.Manivelan21-Nov-17 1:22 
AnswerRe: ISSUE - TCP/IP sockets in MFC VS2017 Pin
Jochen Arndt21-Nov-17 1:59
mveJochen Arndt21-Nov-17 1:59 
AnswerRe: ISSUE - TCP/IP sockets in MFC VS2017 Pin
jschell22-Nov-17 9:05
memberjschell22-Nov-17 9:05 
QuestionTo sort an array of integer's with recursive functions ? Pin
Tarun Jha18-Nov-17 3:46
memberTarun Jha18-Nov-17 3:46 
i have tried it but it doen't work. It would be great if you could point out my mistake and better if correct it.

#include <stdio.h>
#include <conio.h>

int inc_order(int num[], int count, int i);
int compare(int hole, int value, int num[]);

int main(){
	int num[50], n, count, j, i=0;

	printf("Number of integers: \t");
	scanf("%d", &count);

	printf("\nEnter your integers: \n");

	for(n=0; n<count; n++){
		scanf("%d", &num[n]);
	}
	
	inc_order(num, count, i);
	
	for(j=0; j<count; j++){
		printf("%d", num[j]);
	}
	
	return 0;
}

int i=1;

void inc_order(int num[], int count, int i){
	int value, hole;
	
	if(i<count){
		value = num[i];
		hole = i;
	}
	
	compare(hole, value, num);
	inc_order(num, count, i++);
}

int compare(int hole, int value, int num[]){
	
	if(hole==0){
		num[hole]=value;
		return(num[hole]);
	}
	
	if(num[hole-1]>value){
		num[hole] = num[hole-1];
		hole--;
	}
	
	compare(hole, value, num);
}


modified 18-Nov-17 15:38pm.

GeneralRe: To sort an array of integer's with recursive functions ? Pin
PIEBALDconsult18-Nov-17 3:56
protectorPIEBALDconsult18-Nov-17 3:56 
SuggestionTo find hcf of n number by using only loops. Pin
Tarun Jha4-Nov-17 2:20
memberTarun Jha4-Nov-17 2:20 
GeneralRe: To find hcf of n number by using only loops. Pin
Richard MacCutchan4-Nov-17 21:10
protectorRichard MacCutchan4-Nov-17 21:10 
GeneralRe: To find hcf of n number by using only loops. Pin
Tarun Jha7-Nov-17 6:20
memberTarun Jha7-Nov-17 6:20 
GeneralRe: To find hcf of n number by using only loops. Pin
Richard MacCutchan7-Nov-17 7:00
protectorRichard MacCutchan7-Nov-17 7:00 
QuestionIs every C# feature available in C++/Managed ? Pin
Maximilien11-Oct-17 7:26
memberMaximilien11-Oct-17 7:26 
AnswerRe: Is every C# feature available in C++/Managed ? Pin
Richard MacCutchan11-Oct-17 9:50
protectorRichard MacCutchan11-Oct-17 9:50 
AnswerRe: Is every C# feature available in C++/Managed ? Pin
John Schroedl28-Nov-17 2:03
professionalJohn Schroedl28-Nov-17 2:03 
Questionc++ Pin
Member 1340521911-Sep-17 21:51
memberMember 1340521911-Sep-17 21:51 
AnswerRe: c++ Pin
Jochen Arndt11-Sep-17 22:41
mveJochen Arndt11-Sep-17 22:41 
QuestionGet USB drive letter Pin
Member 101933363-Aug-17 0:22
memberMember 101933363-Aug-17 0:22 
SuggestionRe: Get USB drive letter Pin
Jochen Arndt3-Aug-17 1:10
mveJochen Arndt3-Aug-17 1:10 
GeneralRe: Get USB drive letter Pin
Member 101933363-Aug-17 2:31
memberMember 101933363-Aug-17 2:31 
GeneralRe: Get USB drive letter Pin
Jochen Arndt3-Aug-17 2:34
mveJochen Arndt3-Aug-17 2:34 
GeneralRe: Get USB drive letter Pin
Member 101933363-Aug-17 2:32
memberMember 101933363-Aug-17 2:32 
GeneralRe: Get USB drive letter Pin
Richard MacCutchan3-Aug-17 2:38
protectorRichard MacCutchan3-Aug-17 2:38 
GeneralRe: Get USB drive letter Pin
Member 101933363-Aug-17 2:43
memberMember 101933363-Aug-17 2:43 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.