算法与数据结构作业：A∪（B∩C）以及时间复杂度分析

python实现：时间复杂度为O(n^2)

#AU（B∩C）
a = [1,2,4,5,7,8]
b = [1,8,0,3,0,1,0,1,7]
c = [2,3,5,7,9,11,13,15]

temp = []
print("before:")
print("a:"+str(a))
print("b:"+str(b))
print("c:"+str(c))

for bb in b:
    if bb in c:
        temp.append(bb)
for t in temp:
    if t not in a:
        a.append(t)
print("after:"+str(a))
'''
先算B交C的时间复杂度为O（n^2），如果用3层循环嵌套着写时间复杂度为O（n^3）
for bb in b:
    if bb in c and bb not in a:
        a.append(t)
print(a)
'''

 

C++实现：

版本1：时间复杂度O(n^2)

#include <iostream>
#include <cstring>
using namespace std;

void travel(int*,int);

int main(){
	int a[5]={1,2,3,4,5};
	int b[5]={8,2,6,3,9};
	int c[5]={0,8,2,5,4};
	int temp[5]={0};
	int k = 0;
	int count = 5;
	cout<<"before:"<<endl;
	travel(a,5);
	travel(b,5);
	travel(c,5);

	for(int i = 0;i<5;i++){
		for(int j = 0;j<5;j++){
			if(c[i] == b[j]){
				temp[k++] = c[i];
				break;
			}
		}
	}

	int* pNew = new int[5+k];
       	memset(pNew,0,sizeof(int)*(5+k));
	memcpy(pNew,a,sizeof(int)*5);	
	for(int i = 0;i<k;i++){
		int flag = 0;
		for(int j = 0;j<5;j++){
			if(temp[i] == a[j]){
				flag = 1;
				break;
			}
		}
		if(flag == 0){
			pNew[count] = temp[i];  
			count++;
		}
	}
	memcpy(a,pNew,sizeof(int)*count);
	delete[] pNew;
	cout<<"after:"<<endl;
	travel(a,count);
	



}

void travel(int* a,int len){
	for(int i = 0;i<len;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
}

 

版本2：先将3个数组快速排序，时间复杂度为O(logn)，然后将B交C，用二分查找替换原来的for循环，B交C的时间复杂度就为O(nlogn),然后将temp数组并A，同理用二分查找替换原来的for循环，时间复杂度为O(nlogn)，综上，总的时间复杂度为O(nlogn)

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

void travel(int*,int);
bool binary_search(int*,int,int,int);

int main(){
	int a[5]={1,2,3,4,5};
	int b[5]={8,2,6,3,9};
	int c[5]={0,8,2,5,4};
	int temp[5]={0};
	int k = 0;
	int count = 5;
	cout<<"before:"<<endl;
	travel(a,5);
	travel(b,5);
	travel(c,5);
	
	sort(a,a+5);
	sort(b,b+5);
	sort(c,c+5);
	
	cout<<"after sort:"<<endl;
	travel(a,5);
	travel(b,5);
	travel(c,5);
	
	/*
	cout<<"test:"<<endl;
	bool ret  = binary_search(a,0,4,4);
	if(ret) cout<<"a中有4";
	else cout<<"a中没有4";
	*/

	for(int i = 0;i<5;i++){
		if(binary_search(b,0,4,c[i])){
			temp[k++] = c[i];
		}
		/*
		for(int j = 0;j<5;j++){
			if(c[i] == b[j]){
				temp[k++] = c[i];
				break;
			}
		}*/
	}
	cout<<"temp:"<<endl;
	travel(temp,k);

	int* pNew = new int[5+k];
       	memset(pNew,0,sizeof(int)*(5+k));
	memcpy(pNew,a,sizeof(int)*5);	
	for(int i = 0;i<k;i++){
		/*
		int flag = 0;
		for(int j = 0;j<5;j++){
			if(temp[i] == a[j]){
				flag = 1;
				break;
			}
		}*/
		if(/*flag == 0*/!binary_search(a,0,4,temp[i])){
			pNew[count] = temp[i];  
			count++;
		}
	}
	memcpy(a,pNew,sizeof(int)*count);
	delete[] pNew;
	cout<<"after:"<<endl;
	travel(a,count);
	
}

void travel(int* a,int len){
	for(int i = 0;i<len;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
}
bool binary_search(int*a,int left,int right,int data){
	int num = right - left + 1;
	int mid = right + num/2;
	if(num <= 1){
		if(a[mid] == data) return true;
		return false;
	}
	if(a[mid] == data){
		return true;
	}
	else if(a[mid] > data){
		return binary_search(a,left,mid-1,data);
	}else{
		return binary_search(a,mid+1,right,data);
	}
}