write a program to remove duplicate from an ordered char array? in c
- 2 Answers
- 7952 Views
- I also Faced
- E-Mail Answers
Answer Posted / shailesh
i m giving simlpe logic here.first sort the characters and
in a array. then check if a[i]==a[i+1],if yes, then move 1
place ahead i the arrray.
| Is This Answer Correct ? | 5 Yes | 8 No |
Post New Answer View All Answers
Write a C program that will accept a hexadecimal number as input and then display a menu that will permit any of the following operations to be carried out: Display the hexadecimal equivalent of the one's complement. (b) Carry out a masking operation and then display the hexadecimal equivalent of the result. (c) Carry out a bit shifting operation and then display the hexadecimal equivalent of the result. (d) Exit. If the masking operation is selected, prompt the user lor the type of operation (bitwise and, bitwise exclusive or, or bitwise or) and then a (hexadecimal) value for the mask. If the bit shifting operation is selected. prompt the user for the type of shift (left or right), and then the number of bits. Test the program with several different (hexadecimal) input values of your own choice.
How do you convert strings to numbers in C?
develop algorithms to add polynomials (i) in one variable
Differentiate between null and void pointers.
What is the difference between union and anonymous union?
ATM machine and railway reservation class/object diagram
can any one please explain, how can i access hard disk(physical address)? it is possible by the use of far,near or huge pointer? if yes then please explain......
What is pointer to pointer in c with example?
what is associativity explain what is the precidence for * and & , * and ++ how the folloing declaration work 1) *&p; 2) *p++;
`write a program to display the recomended action depends on a color of trafic light using nested if statments
hi send me sample aptitude papers of cts?
What is the general form of a C program?
what is associativity explain what is the precidence for * and & , * and ++ how the folloing declaration work 1) *&p; 2) *p++;
List at least 10 sorting methods indicating their average case complexity, worst case complexity and best case complexity.
What are compound statements?
