Problem Statement: Merging and Sorting of character arrays
You are required to write a program that takes character values in two different arrays as input from user. After getting input, make a third array and merge both these array in third array. Output array must be sorted in ascending order.

Detailed Description:

1. Declare three character type arrays.
2. Use two arrays to take input from user.
o Take input as char type.
o Take 10 values in each array.

3. Merge both these input arrays.
o If an input character is in both arrays, then it should appear once in resulted array.
4. Store result in third array.
5. Sort resulted array in ascending order.
o Ascending order means string values starting from ‘a’ will come first, and then starting from ‘b’ and so on.
6. Display them after sorting

Sample Output
Enter values in first array: a h b c u v I j k e
Enter values in Second array: y u d f g k I w q a

Merged array: a y h u b d c f g v k I j w q e

Sorted Array in ascending order: a b c d e f g h I j k q u v w y

Take it step by step.

create this part first :

``````Enter values in first array: a h b c u v I j k e
Enter values in Second array: y u d f g k I w q a``````

Then create this part :

``Merged array: a y h u b d c f g v k I j w q e``

And then sort it.

For the merge part, you function prototype could look like this :

``void mergeArray(char * src1, int src1Size, char * src2, int src2Size, char * dest);``

It assumes that dest has enough memory.
{"ft_lang_label":"__label__en","ft_lang_prob":0.772635,"math_prob":0.75017226,"size":1024,"snap":"2020-10-2020-16","text_gpt3_token_len":253,"char_repetition_ratio":0.14509805,"word_repetition_ratio":0.0,"special_character_ratio":0.24414062,"punctuation_ratio":0.11297071,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9593479,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-22T19:31:50Z\",\"WARC-Record-ID\":\"<urn:uuid:3784f835-b9bd-43fd-9713-2702bd60a2c8>\",\"Content-Length\":\"43760\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:86b2c10b-0fff-44a7-9014-9591f0a01282>\",\"WARC-Concurrent-To\":\"<urn:uuid:f3a39e61-1dd4-478d-a4ee-6a13d09692eb>\",\"WARC-IP-Address\":\"169.55.25.107\",\"WARC-Target-URI\":\"https://www.daniweb.com/programming/software-development/threads/239140/merge-and-sort\",\"WARC-Payload-Digest\":\"sha1:EDH42ILM4JN2WQS2M3X2OYULGDVB67X3\",\"WARC-Block-Digest\":\"sha1:BIUQTAOCQ6SSHBBSACMJ7D2IVE6GZB7U\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875145713.39_warc_CC-MAIN-20200222180557-20200222210557-00256.warc.gz\"}"}