Search
Search titles only
By:
Search titles only
By:
Log in
Register
Search
Search titles only
By:
Search titles only
By:
Menu
Install the app
Install
Forums
New posts
All threads
Latest threads
New posts
Trending threads
Trending
Search forums
What's new
New posts
New ads
New profile posts
Latest activity
Free Ads
Latest reviews
Search ads
Members
Current visitors
New profile posts
Search profile posts
Contact us
Latest ads
Power Lifting Lever Belt
SkullVamp
Updated:
Jun 13, 2026
Ad icon
port.lk Domain for sale
Lankan-Tech
Updated:
Jun 13, 2026
Colombo
Kaduwela - Two Storey House for Sale
dilrasan
Updated:
Jun 11, 2026
Ad icon
Wechat qr verification
Pawan2005
Updated:
Jun 11, 2026
🚀 GOOGLE AI PRO 18 MONTHS ACTIVATION 🚀
sayuru bandara
Updated:
Jun 10, 2026
Electronics
Vehicles
Property
Search
Reply to thread
Forums
General
ElaKiri Talk!
Merge sort in c
Get the App
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Message
<blockquote data-quote="Tom Riddle" data-source="post: 16418474" data-attributes="member: 47610"><p><span style="font-size: 15px"><span style="color: Blue"></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"></span></span></p><p><span style="font-size: 15px"><span style="color: Blue">1. Meka MergeSort algorithm eka nemei. Me MergeSort wala "Merge" step eka witharayi. me merge step eka mulama array eka 2ta kada kada recursively call wenna ona. mata meka wisthara karanna nam welawak ne pothakin hariyata balala therum ganna</span></span></p><p><span style="font-size: 15px"><span style="color: Blue"></span></span></p><p><span style="font-size: 15px"><span style="color: Blue">2. Methana weraddak thiyenawa. me widiyata wenas wenna ona</span></span></p><p><span style="font-size: 15px"><span style="color: Blue"></span></span></p><p><span style="font-size: 15px"><span style="color: Blue">if(<span style="color: Green"><span style="font-size: 22px">i == n</span></span>) {</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">while(<span style="color: Green"><span style="font-size: 22px">j< m</span> </span>)</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">{</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">c[k] = b[j];</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">j++;</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">k++;</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">}</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">}</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">else</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">{</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">while(<span style="color: Green"><span style="font-size: 22px">i < n</span></span> )</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">{</span></span></p><p><span style="font-size: 15px"><span style="color: Blue">c[k] = a<em>;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>i++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>k++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>3. wediya hondayi oka if (i == n) , else if (j ==m), else {printf "error!!!"} kiyala liwwanam. pahadili saha anthima else ekata awama therenewa mokakhari nohithapu deyak wela kiyala</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>4. variable walata therumak athi nam danna. pissu hadenewa balanna giyama. </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>5. me code eken wenna one de wenawa. methana (<a href="http://www.compileonline.com/compile_c_online.php" target="_blank">http://www.compileonline.com/compile_c_online.php</a>) online compile karala baluwe compiler ekak ne me man inna machine eka</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>[CODE]</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>#include<stdio.h></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>void main() </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>int n,m, i, j,k;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>n = 5;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>int a[5] = {8,5,1,6,3};</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>m = 3;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>int b[3] = {2,7,10};</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>int c[8]; //= {0,0,0,0,0,0,0,0};</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>/*</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("Enter how many numbers you want First Array:" );</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>scanf("%d", &n);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("Enter the %d numbers:\n", n);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>for (i = 0; i < n; i++) </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>scanf("%d", &a[i]);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("Enter how many numbers you want Second Array: ");</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>scanf("%d", &m);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("Enter the %d numbers:\n", n);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>for (j = 0; j < m; j++) </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>scanf("%d", &b[j]);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n The given First array is:\n");</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>for (i = 0; i < n; i++) </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n\t\%d", a[i]);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n The given Second array is:\n");</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>for (j = 0; j < m; j++) </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n\t\%d", b[j]);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>*/</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>i,j,k=0;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>while(i<n && j<m ) {</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>if(a[i] < b[j] )</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{ </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>c[k] = a[i];</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>i++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>else</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>c[k] = b[j];</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>j++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>k++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("i = %d, j = %d, k = %d", i, j, k);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>if(i == n) {</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>while(j< m )</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>c[k] = b[j];</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>j++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>k++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>else</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>while(i < n )</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>{</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>c[k] = a[i];</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>i++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>k++;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n\n The sorted array using Merge sort is:\n");</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>int r;</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>for (r = 0; r < (n+m); r++) </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>printf("\n\t%d", c[r]);</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>//getch();</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>}[/CODE]</em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em>oka wage umbe code eka hadala balanna. hard code karapu values ayin karala data input karana kalla eeta passe test karanna. </em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p><p><span style="font-size: 15px"><span style="color: Blue"><em></em></span></span></p></blockquote><p></p>
[QUOTE="Tom Riddle, post: 16418474, member: 47610"] [SIZE="4"][COLOR="Blue"] 1. Meka MergeSort algorithm eka nemei. Me MergeSort wala "Merge" step eka witharayi. me merge step eka mulama array eka 2ta kada kada recursively call wenna ona. mata meka wisthara karanna nam welawak ne pothakin hariyata balala therum ganna 2. Methana weraddak thiyenawa. me widiyata wenas wenna ona if([COLOR="Green"][SIZE="6"]i == n[/SIZE][/COLOR]) { while([COLOR="Green"][SIZE="6"]j< m[/SIZE] [/COLOR]) { c[k] = b[j]; j++; k++; } } else { while([COLOR="Green"][SIZE="6"]i < n[/SIZE][/COLOR] ) { c[k] = a[i]; i++; k++; } 3. wediya hondayi oka if (i == n) , else if (j ==m), else {printf "error!!!"} kiyala liwwanam. pahadili saha anthima else ekata awama therenewa mokakhari nohithapu deyak wela kiyala 4. variable walata therumak athi nam danna. pissu hadenewa balanna giyama. 5. me code eken wenna one de wenawa. methana ([url]http://www.compileonline.com/compile_c_online.php[/url]) online compile karala baluwe compiler ekak ne me man inna machine eka [CODE] #include<stdio.h> void main() { int n,m, i, j,k; n = 5; int a[5] = {8,5,1,6,3}; m = 3; int b[3] = {2,7,10}; int c[8]; //= {0,0,0,0,0,0,0,0}; /* printf("Enter how many numbers you want First Array:" ); scanf("%d", &n); printf("Enter the %d numbers:\n", n); for (i = 0; i < n; i++) scanf("%d", &a[i]); printf("Enter how many numbers you want Second Array: "); scanf("%d", &m); printf("Enter the %d numbers:\n", n); for (j = 0; j < m; j++) scanf("%d", &b[j]); printf("\n The given First array is:\n"); for (i = 0; i < n; i++) printf("\n\t\%d", a[i]); printf("\n The given Second array is:\n"); for (j = 0; j < m; j++) printf("\n\t\%d", b[j]); */ i,j,k=0; while(i<n && j<m ) { if(a[i] < b[j] ) { c[k] = a[i]; i++; } else { c[k] = b[j]; j++; } k++; } printf("i = %d, j = %d, k = %d", i, j, k); if(i == n) { while(j< m ) { c[k] = b[j]; j++; k++; } } else { while(i < n ) { c[k] = a[i]; i++; k++; } } printf("\n\n The sorted array using Merge sort is:\n"); int r; for (r = 0; r < (n+m); r++) printf("\n\t%d", c[r]); //getch(); } }[/CODE] oka wage umbe code eka hadala balanna. hard code karapu values ayin karala data input karana kalla eeta passe test karanna. [/i][/COLOR][i][/i][/SIZE][i][/i] [/QUOTE]
Insert quotes…
Verification
Hath warak paha keeyada? (hatha wadikireema paha)
Post reply
Top
Bottom