answersLogoWhite

0

C program for sorting the numbers is very basic, start writing it and if you are having problems, post your program here and a description of the problem and you will be helped.

If you are taking a computer course, how do you expect to pass exams if you have plagiarized someone else work for your assignments.

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

Ascending order program for java?

public class BubbleSortAscendingOrderDemo { public static void main(String a[]) { //Numbers which need to be sorted int numbers[] = {23,5,23,1,7,12,3,34,0}; //Displaying the numbers before sorting System.out.print("Before sorting, numbers are "); for(int i = 0; i < numbers.length; i++) { System.out.print(numbers[i]+" "); } System.out.println(); //Sorting in ascending order using bubble sort bubbleSortInAscendingOrder(numbers); //Displaying the numbers after sorting System.out.print("Before sorting, numbers are "); for(int i = 0; i < numbers.length; i++) { System.out.print(numbers[i]+" "); } }


How do you write a C program to calculate execution time of a program using all C sorts?

To calculate the execution time of a C program using different sorting algorithms, you can utilize the clock() function from the time.h library. First, include the library at the top of your program. Before calling the sorting function, capture the current clock time using clock_t start = clock();. After the sorting is complete, capture the end time with clock_t end = clock(); and calculate the execution time in seconds using (double)(end - start) / CLOCKS_PER_SEC. This will give you the time taken by the sorting algorithm to execute.


How do write sorting of numbers using microprocessor?

There are several methods available to sort numbers. A simple way to program sorting is the so-called "bubble-sort". This is inefficient for larger lists of numbers; in which case it is more convenient to use one of the faster algorithms, for example, "quick-sort".


Types of sorting in 8085 microprocessor?

Sorting is not a microprocessor specific thing. Sorting requires a program and, as such, is not dependent on which microprocessor is involved.


How do you write a C plus plus program that will display the first 10 positive prime numbers?

By learning how to program on C+.


How do you write a program in objective c numbers 1-100 prime numbers?

fdsgfhgdfhgdf


Program to print sorting of an array?

For program in C language: http://wiki.answers.com/Q/Program_to_print_sorting_of_an_array_in_clanguage&updated=1&waNoAnsSet=2 Program in C++: #include #include void main() { int i,j,n,t,a[50]; clrscr(); cout"%d",&n; cout


What is is sorting?

sorting can be described as the arrangement of text/numbers either in Ascending or Descending order


How to write a C program to find largest 2 numbers using pointers?

program to find maximum of two numbers using pointers


Write a program for sorting for numbers without repited values?

Any number variable is extends the Number in java and it already implemented Comparable interface. So when you have a list of numbers, just use Arrays.sort().


Using only one program implement bubble sorting insertion sorting quick sorting and selection sorting?

Its simple!dirve a menu based prog by using switch case & then apply every sorting function to it.


What is the code for arranging numbers in c language?

That depends on the sorting algorithm you'd like to use. Usually, Quick-sort is good enough for your purposes, but if your application needs to be fast, you might want to read some documents about sorting.