Write a function called delete_repeats that has a partially filled characters as

Question

Write a function called delete_repeats that has a partially filled characters as a formal parameter and that deletes all repeated letters Q array. Since a partially filled array requires two arguments, the function will actually have two formal parameters: an array parameter and a formal parameter of type int that gives the number of array positions used. When a letter is deleted, the remaining letters are moved forward to fill in the gap This will create empty positions at the end of the array so that less of the array is used Since the formal parameter is a partially filled array, a second formal parameter of type int will tell how many array positions are filled. This second formal parameter will be a call-by-reference parameter and will be changed to show how much of the array is used after the repeated letters are deleted. For example, consider the following code: char a[10]; a[0] = 'a'; a[1] = 'b'; a[2] = 'a'; a[3] = 'c'; int size = 4; after this code is executed the value of a[0] is 'a', the value of a[1] is 'b', the value of a[2] is 'c', and the value of size is 3. (The value of a[3] is no longer of any concern, since the partially filled array no longer uses this indexed variable.) You may assume that the partially filled array contains only lowercase letters. Embed your function in a suitable test program.

Explanation / Answer

#include<iostream>
using namespace std;
void delete_repeats(char *arr,int &size);
int main() {
    char a[10];
    a[0] = 'a';
    a[1] = 'b';
    a[2] = 'a';
    a[3] = 'c';
    a[4] = 'c';
    a[5] = 'c';
    a[6] = 'e';
    a[7] = 'c';
    a[8] = 'c';
    a[9] = 'f';
   
    int size =10;
    delete_repeats(a,size);

    for(int i=0;i<size;i++){
        cout<<a[i]<<endl;
    }
    return 0;
}
void delete_repeats(char *arr,int &size){
    for(int i=0;i<size-1;i++){
        for(int j=i+1;j<size;j++){
            if(arr[i]==arr[j]){
                for(int k=j;k<size;k++){
                    arr[k]=arr[k+1];
                   
                }
                size--;
                j--;
            }
        }
    }
}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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