Computer Stuff Kit Tricks

What is declaring structure variable in C language?

Sunday 25 June 2023

Sorting Algorithms in C

What is sorting Algorithms?

Sorting means set out or arranging a set of data in some order. There are unlike or different methods that are used to sort the data in arise or ascending or descending or go down order. Few of them are listed and talk about or discussed in detail below.

sorting Algorithms, bubble sort, selection sort, quick sort

Sorting Algorithms in C Image-1

1. Bubble sort

2. Selection sort

3. Insertion sort

4. Heap sort

5. Merge sort

6. Quick sort

1.1 Bubble Sort

Bubble sort is a simple sorting task or algorithm. The task or algorithm gets its name from the way smaller part or elements “bubble” to the top of the list. Because it only uses balancing or comparisons to work or operate on elements, it is a balancing or comparison sort.

1.2 Selection sort

Selection sort is a sorting task or algorithm, particular or specifically an in-place balancing or comparison sort.

1.3 Insertion sort

Insertion sort is a simple sorting task or algorithm, a balancing or comparison sort in which the sorted array (or list) is built one entry at a time. It is much less logical on large lists than more up to date algorithms or task such as quick sort, heap sort, or merge sort. However, insertion sort give several advantages:

1. Simple implementation or execution

2. Efficient or adequate for (quite) small data sets

3. Adaptive or flexible, i.e. efficient for data or record sets that are already substantially or greatly sorted: the time difficulty or complexity is O(n +d), where d is the number of inversions or reversal.

4. More logical or efficient in practice than most other simple foursquare or quadratic (i.e. O(n square)) algorithms or task such as selection sort or bubble sort: the average running time is n square/4, and the management or running time is linear in the best case

5. Stable, i.e. does not change the respective or relative order of part or elements with equal keys

6. In-place, i.e. only requires a continuous or constant amount O(1) of additional memory space

7. Online, i.e. can sort a list as it collect or receives it.

1.4 Heap sort

The heap sort works as its name submit or suggests. It begins by place or building a heap out of the data set, and then take out or removing the largest item and set or placing it at the end of the sorted array. After removing the largest item, it rebuild or reconstructs the heap, removes the largest last or remaining item, and places it in the next open place or position from the end of the sorted array. This is frequent or repeated until there are no items left in the heap and the sorted array is full. Elementary or easy implementations require two arrays – one to hold the mass or heap and the other to hold the sorted part or elements.

1.5 Merge sort

Merge sort is an O(n log n) balancing or comparison-based sorting task or algorithm. In most implementations or execution it is stable, meaning that it protect or preserves the input order of equal part or elements in the sorted output. It is an example of the divide and conquer algorithmic or task paradigm. It was create or invented by john von Neumann in 1945.

1.6 Quick sort

The quick sort algorithm was grow or developed by C. A. R. Hoare while in the Soviet Union, as a stay with or visiting student at Moscow State University. At that time, Hoare worked in a project a tool or machine translation for the National Physical Laboratory.

Computer stuff kit tricks of Topics 67.

What is string library functions in C language?

What is Compilation Stages in C language?

Saturday 24 June 2023

Data Structure in C

What is Data Structure?

Consider a plan or program to work on the data of students in a school. Each students record would have definite certain fields namely naming or identity number, student name, class etc. From what we have take in or learnt so far we could use a structure to summarize or encapsulate these fields. We store these data or records in files, so we could use structure flexible or variables to read a record from a file or write a data or record to a file.

Data Structure Image-1

If we wanted to operate or manipulate several data or records at once we would need an array of structures. Say if we wanted to show, all the students data or records in the order of their naming or identity numbers we would need to read them from the file they are keep or stored into an array of structures.

This is because the C language does not offer any file company or organization methods other than the uninterrupted or sequential file operation or organization. In other words when you write data or records into a file in the C language you write the data or records in a sequence. The language does not offer any operation or organization such as sign or index File Company or organization where the data or records can be read or accessed at random on a key value.

The fseek function does allow random read or access to file data but only based on the byte balance or offset. Therefore we first have to access or read them into an array of structures, sort the array by the key area or field, and display each element of the array.

Here is where we can see the issue or problem with arrays during coding or programming. The question, which appear or arises, is what should the size of the array? Obviously or clearly our array must have at least as many elements or components as the biggest or maximum number of records we plan or intend reading from the file.

Now, if we utilize or use an array that is too big (say there are only five hundred data or records in the data file and the array size we have put or set, to read or access these data or records into, is one thousand elements or components long) every time we run the plan or program we are going to set aside or reserve memory for one thousand structures but use only five hundred.

Worse or poor would be the case if the number of students in the school grow or increases to over a thousand. Then we would have to change the plan or program code and grow or increase the army size and keep doing so forever.

Computer stuff kit tricks of Topics 66.

What is C Preprocessor in C language?

What is C Preprocessor in C language?

Thursday 22 June 2023

Compilation Stages in C

What is Compilation Stages?

Consider a simple program hello.c

#include<stdio.h>
int main()
{
printf(“hello, computer\n”);
return 0;
}

C language, compilation stages tips, tips and tricks

Compilation stage image-1

The first work or action is to activate a preliminary or opening process called the initialization or pre-processor. In the case of hello.c all it does is to return or replace the line #include <stdio.h> with the file stdio.h from the cover or include files library. The file stdio.h provides or gives us with a suitable or convenient way of telling the author or compiler that all the i/o task or functions exist. There are a few other little item or things in stdio.h but they need not cover or concern us at this stage.

In order to see what the initialization or pre-processor actually outputs, you might like to topic or issue the command:

cc-E hello.c – o hello.i

The ‘cc’ command will operate or activate the ‘C’ compilation or collection system and the –E option will stop the collection or compilation process after the pre-processing stage, and another file will have look or appeared in your directory. Have a look, find hello.i and use the editor in view method or mode to have a look at it. So issue the command:

vi hello.i

You will see that a number of lines of work or text have been added at the front of the hello.c plan or program. What’s all this matter or stuff? Well, have a look in the file called /usr/include/stdio.h again using the view instruct or command.

vi /usr/include/stdio.h

Now the next period or stage of getting from your program text to a perform or executing plan or program is the collection or compilation of your text into an assembler code program. After all that is what a editor or compiler is for – to turn a high level language script into a plan or program.

Let’s see what happens by issuing the instruct or command

cc –C hello.s –o hello.o

Now, yet again there is another file in your index or directory – this time the suffix is “.o”. This file or folder is called the object file. It carry or contains the machine command or instructions keep in touch or corresponding exactly to the help or mnemonic codes in the .s file. The next stage in the collection or compilation process is called by a diversity or variety of names –“loading”, “link editing”, “linking”. What happens is that the tool or machine instructions in the object file (.o) are joined to many more order or instructions selected from a huge or enormous collection of functions in a library.

Computer stuff kit tricks of Topics 65.