The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Ashish Yadav , an ibibo Wizard, at 6:04 PM on August 05, 2008

well, The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Hemant Singh , an ibibo Master, at 11:25 AM on August 04, 2008

well, The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by R.P. Singh , an ibibo Master, at 7:06 PM on July 24, 2008

well, The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Rocky , an ibibo Master, at 3:09 PM on July 22, 2008

well, The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Ni .. , an ibibo Master, at 12:35 AM on July 18, 2008

well, The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Romi , an ibibo Master, at 11:50 AM on July 17, 2008

The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by .... ..... , an ibibo Master, at 8:37 AM on July 17, 2008

The origin of C is closely tied to the development of the Unix operating system, originally implemented in assembly language on a PDP-7 by Ritchie and Thompson, incorporating several ideas from colleagues. Eventually they decided to port the operating system to a PDP-11. B's lack of functionality to take advantage of some of the PDP-11's features, notably byte addressability, led to the development of an early version of the C programming language.
Selection sort is the most conceptually simple of all the sorting algorithms you mentioned. Because a selection sort looks at progressively smaller parts of the array each time (as it knows to ignore the front of the array because it is already in order), a selection sort is slightly faster than bubble sort, and can be better than a modified bubble sort. In general, any of these sorting algorithms are good enough for most small tasks, though if you were going to process a large amount of data, you would want to choose Heap Sort/Merge Sort or Quick Sort.

Answered by Om Prakash , an ibibo Master, at 7:12 PM on July 16, 2008

It was named "C" because many of its features were derived from an earlier language called "B", which according to Ken Thompson was a stripped-down version of the BCPL programming language.The initial development of C occurred at AT&T Bell Labs

B is a programming language that was developed at Bell Labs.

BCPL (Basic Combined Programming Language)BCPL was no longer in common use.influence is still felt because the language B, upon which the C programming language was based, was a stripped down and syntactically changed version of BCPL.

http://en.wikipedia.o rg/wi ki /C_language#

Answered by Sharad Singh , an ibibo Master, at 1:36 PM on July 16, 2008

hi there

It was named "C" because many of its features were derived from an earlier language called "B", which according to Ken Thompson was a stripped-down version of the BCPL programming language.The initial development of C occurred at AT&T Bell Labs

B is a programming language that was developed at Bell Labs.

BCPL (Basic Combined Programming Language)BCPL was no longer in common use.influence is still felt because the language B, upon which the C programming language was based, was a stripped down and syntactically changed version of BCPL.

http://en.wikipedia.org/wi ki /C_language#

Answered by Reeta K , an ibibo Master, at 6:50 PM on July 13, 2008