Difference between strncmp() and strcmp in C/C++ Last Updated : 10 Nov, 2022 Comments Improve Suggest changes Like Article Like Report The basic difference between these two are : strcmp compares both the strings till null-character of either string comes whereas strncmp compares at most num characters of both strings. But if num is equal to the length of either string than strncmp behaves similar to strcmp.Problem with strcmp function is that if both of the strings passed in the argument is not terminated by null-character, then comparison of characters continues till the system crashes. But with strncmp function we can limit the comparison with num parameter. When pass str1 and str2 as parameters to strcmp() function, it compares both the strings character by character till null-character('\0'). In our case, upto character 's' both the strings remain same but after that str1 has character 'h' having ASCII value 104 and str2 has null-character having ASCII value 0. Since the ASCII value of str1 character is greater than ASCII value of str2 character, so strcmp() function returns value greater than zero. Hence, string str1 is greater than string str2 in strcmp() function. When pass these parameters in strncmp() function with the 3rd parameter num upto which want to compare strings then it compares both the strings character by character till num(if num <= length of smallest string) or till null character of smallest string. In our case, both the strings have same character upto num, so strncmp() function returns value zero. Hence, string str1 is equal to string str2 in strncmp() function. CPP // C, C++ program demonstrate difference between // strncmp() and strcmp() #include <stdio.h> #include <string.h> int main() { // Take any two strings char str1[] = "akash"; char str2[] = "akas"; // Compare strings using strncmp() int result1 = strncmp(str1, str2, 4); // Compare strings using strcmp() int result2 = strcmp(str1, str2); // num is the 3rd parameter of strncmp() function if (result1 == 0) printf("str1 is equal to str2 upto num characters\n"); else if (result1 > 0) printf("str1 is greater than str2\n"); else printf("str2 is greater than str1\n"); printf("Value returned by strncmp() is: %d\n", result1); if (result2 == 0) printf("str1 is equal to str2\n"); else if (result2 > 0) printf("str1 is greater than str2\n"); else printf("str2 is greater than str1\n"); printf("Value returned by strcmp() is: %d", result2); return 0; } Output: str1 is equal to str2 upto num characters Value returned by strncmp() is: 0 str1 is greater than str2 Value returned by strcmp() is: 104 Let us see the differences in a tabular form -: strncmp()strcmp1.It is a C library Function.It is library function in C and C++2. Its syntax is -: strncmp(const char *str1, const char *str2, size_t n) Its syntax is -: int strcmp ( const char * str1, const char * str2 ); 3.It takes two parameters that is string1 and string2This function performs a binary comparison of the characters.4.Its return value is integer type.It perform operations until NULL is reached. Comment More infoAdvertise with us Next Article Difference between strncmp() and strcmp in C/C++ A Akash Gupta Improve Article Tags : Difference Between C Language C++ DSA C-String +1 More Practice Tags : CPP Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read C Programming Language Tutorial C is a general-purpose mid-level programming language developed by Dennis M. Ritchie at Bell Laboratories in 1972. It was initially used for the development of UNIX operating system, but it later became popular for a wide range of applications. Today, C remains one of the top three most widely used 5 min read C++ Programming Language C++ is a computer programming language developed by Bjarne Stroustrup as an extension of the C language. It is known for is fast speed, low level memory management and is often taught as first programming language. It provides:Hands-on application of different programming concepts.Similar syntax to 5 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Like