Can you edit the bold part of the code in the removeDuplicateWithShift() block t

Question

Can you edit the bold part of the code in the removeDuplicateWithShift() block to make it even simpler? The desired output is 1 2 3 4 5 6 7 9 0 0 0, as shown in the page. Thanks!

#include
#include
#include
//using namespace std;
int a[] = { 1, 7, 1, 2, 4, 6, 1, 9, 9, 2 };
int size = sizeof(a)/sizeof(a[0]);
void display() {
for (int i = 0; i < size; i++) {
printf("%d ", a[i]);
}
printf(" ");
}
void insertionSort() {
for(int i = 1; i < size; i++) {
for(int j = i-1; j >= 0; j--){
int temp = a[j];
if(a[j] > a[j+1]){
a[j] = a[j+1];
a[j+1] = temp;
}
else
break;
}
}
}
void deleteDuplicates() {
for(int i = size-1; i >= 0; i--) {
if(a[i] == a[i-1])
a[i] = 0;
}
}
void removeDuplicateWithShift(){
int index = 1;
for(int i=0;i for(int j=(i+1);j if((a[i]^a[j]) ==0) {
a[j] = 0;
}
if((a[j] == 0) && j < size-1){
if(j!=8)
a[j] = a[j+1] == 0? a[j+2]:a[j+1];
a[j+1] =0;
}
}
}
}

int main(){
display();
insertionSort();
printf("After the array is sorted ");
display();
deleteDuplicates();
printf("After the duplicates are removed the element of the array are: ");
display();
removeDuplicateWithShift();
printf("Removes the duplicates and shift the elements to an empty index ");
display();
return 0;
}

signment 1 ogramming Exercise (Array and simple sort Algorithm) 1. In an array example program, add a method called removeDuplicate0 that removes duplicates from a previously sorted array without disrupting the order of index. When a duplicate element is found, the discovered element is then replaced by zero. For example, if the elements of the array are: 27 1 1 4 6 1 39 2 After the array is sorted, (you may use any simple sorting algorithm for this part): 11 1 2 2 3 4 6 79 After the duplicates are removed the elements of the array are: 1 0 0 203 4 679 What is the Big (o of removing duplicates operation? 2. that removes the duplicate and shift the element to an empty index. For example, if the elements of the array are 27 1 1 4 6 1 3 9 2 1 1 1 2 2 3 4 679 After the duplicates are removed the elements of the array are: 1 2 3 4 679 0 0 0 What is the Big(o) of removing duplicates operation?

Explanation / Answer

#include<stdio.h>
#include<conio.h>

//using namespace std;
int a[] = { 1, 7, 1, 2, 4, 6, 1, 9, 9, 2 };
int size = sizeof(a)/sizeof(a[0]);
int c=0;
void display() {
for (int i = 0; i < size; i++) {
printf("%d ", a[i]);
}
printf(" ");
}
void insertionSort() {
for(int i = 1; i < size; i++) {
for(int j = i-1; j >= 0; j--){
int temp = a[j];
if(a[j] > a[j+1]){
a[j] = a[j+1];
a[j+1] = temp;
}
else
break;
}
}
}
void deleteDuplicates() {
for(int i = size-1; i >= 0; i--) {
if(a[i] == a[i-1])
a[i] = 0;
}
}
/* Added code*/
public int removeDuplicates(input[]){

int j = 0;
int i = 1;
//return if the array length is less than 2
if(input.length < 2){
return input;
}
while(i < input.length){
if(input[i] == input[j]){
i++;
}else{
input[++j] = input[i++];
}   
}
int[] output = new int[j+1];
for(int k=0; k<output.length; k++){
output[k] = input[k];
}

return output;
}
   /* Added code*/

}
}
int main(){
display();
insertionSort();
printf("After the array is sorted ");
display();
deleteDuplicates();
printf("After the duplicates are removed the element of the array are: ");
display();
int[] output = removeDuplicateWithShift(a[]);
for(c=0;c<output;c++)
printf("%d ",output[c]);

printf("Removes the duplicates and shift the elements to an empty index ");
display();
return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.