Skip to main content

How to Split String in Equal Parts: C#

String is a text of Unicode characters in any programming language, it can be changeable as the user want. Splitting a string means to divide a string in an array after performing some operations on it. These operation may be to remove desired character, blank spaces or find out a substring of a particular length.

A string can be split into chunks of equal size, given by the user. Create two string variable, first will contains the original string that is to be split, second string is empty and will contain the split string.

Write the following code in which for loop is used to get our desired chunk size. I am dividing the string in chunks of 4.
string stringToDivide = "abcdefghijklmnopqrstuvwxyz";
string stringAfterDivide = string.Empty;
int part = 4;
int stringLength = stringToDivide.Length;
for (int i = 0; i < stringLength; i += part)
{
if (i + part > stringLength) part = stringLength - i;
stringAfterDivide += stringToDivide.Substring(i, part) + " ";
}
MessageBox.Show(stringAfterDivide);

I am using alphabets as original string, and at the last the string will be divide in chunk of four as shown in below message box.

How to split string in equal parts in windows forms C#


The string can be changed according to the user’s requirements, or may be input by the user through the textbox. The chunk size can also be changed, or may also be input by the user. 

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …