id	sid	tid	token	lemma	pos
fcis-24159	1	1	frontiers	frontier	NOUN
fcis-24159	1	2	in	in	ADP
fcis-24159	1	3	computing	computing	NOUN
fcis-24159	1	4	and	and	CCONJ
fcis-24159	1	5	intelligent	intelligent	ADJ
fcis-24159	1	6	systems	system	NOUN
fcis-24159	1	7	issn	issn	VERB
fcis-24159	1	8	:	:	PUNCT
fcis-24159	1	9	2832	2832	NUM
fcis-24159	1	10	-	-	SYM
fcis-24159	1	11	6024	6024	NUM
fcis-24159	1	12	|	|	NOUN
fcis-24159	1	13	vol	vol	NOUN
fcis-24159	1	14	.	.	PROPN
fcis-24159	2	1	9	9	NUM
fcis-24159	2	2	,	,	PUNCT
fcis-24159	2	3	no	no	INTJ
fcis-24159	2	4	.	.	NOUN
fcis-24159	2	5	1	1	NUM
fcis-24159	2	6	,	,	PUNCT
fcis-24159	2	7	2024	2024	NUM
fcis-24159	3	1	53	53	NUM
fcis-24159	3	2	"	"	PUNCT
fcis-24159	3	3	algorithm	algorithm	NOUN
fcis-24159	3	4	analysis	analysis	NOUN
fcis-24159	3	5	and	and	CCONJ
fcis-24159	3	6	design	design	NOUN
fcis-24159	3	7	"	"	PUNCT
fcis-24159	3	8	python	python	NOUN
fcis-24159	3	9	teaching	teach	VERB
fcis-24159	3	10	examples	example	NOUN
fcis-24159	3	11	of	of	ADP
fcis-24159	3	12	recursive	recursive	ADJ
fcis-24159	3	13	and	and	CCONJ
fcis-24159	3	14	partitioning	partition	VERB
fcis-24159	3	15	algorithms	algorithms	PROPN
fcis-24159	3	16	ying	ying	PROPN
fcis-24159	3	17	zhang	zhang	PROPN
fcis-24159	3	18	,	,	PUNCT
fcis-24159	3	19	min	min	PROPN
fcis-24159	3	20	zhou	zhou	PROPN
fcis-24159	3	21	,	,	PUNCT
fcis-24159	3	22	wenxuan	wenxuan	PROPN
fcis-24159	3	23	guo	guo	PROPN
fcis-24159	3	24	,	,	PUNCT
fcis-24159	3	25	ruiqi	ruiqi	PROPN
fcis-24159	3	26	zhu	zhu	PROPN
fcis-24159	3	27	*	*	PUNCT
fcis-24159	3	28	,	,	PUNCT
fcis-24159	3	29	jieyu	jieyu	NOUN
fcis-24159	3	30	liufu	liufu	PROPN
fcis-24159	3	31	,	,	PUNCT
fcis-24159	3	32	jiawei	jiawei	PROPN
fcis-24159	3	33	lin	lin	PROPN
fcis-24159	3	34	,	,	PUNCT
fcis-24159	3	35	zhengtao	zhengtao	PROPN
fcis-24159	3	36	li	li	PROPN
fcis-24159	3	37	school	school	PROPN
fcis-24159	3	38	of	of	ADP
fcis-24159	3	39	mathematics	mathematic	NOUN
fcis-24159	3	40	and	and	CCONJ
fcis-24159	3	41	computer	computer	NOUN
fcis-24159	3	42	,	,	PUNCT
fcis-24159	3	43	guangdong	guangdong	PROPN
fcis-24159	3	44	ocean	ocean	PROPN
fcis-24159	3	45	university	university	PROPN
fcis-24159	3	46	,	,	PUNCT
fcis-24159	3	47	zhanjiang	zhanjiang	PROPN
fcis-24159	3	48	,	,	PUNCT
fcis-24159	3	49	guangdong	guangdong	PROPN
fcis-24159	3	50	,	,	PUNCT
fcis-24159	3	51	524088	524088	NUM
fcis-24159	3	52	,	,	PUNCT
fcis-24159	3	53	china	china	PROPN
fcis-24159	3	54	*	*	PUNCT
fcis-24159	3	55	corresponding	correspond	VERB
fcis-24159	3	56	author	author	NOUN
fcis-24159	3	57	:	:	PUNCT
fcis-24159	3	58	ruiqi	ruiqi	PROPN
fcis-24159	3	59	zhu	zhu	PROPN
fcis-24159	3	60	(	(	PUNCT
fcis-24159	3	61	email	email	NOUN
fcis-24159	3	62	:	:	PUNCT
fcis-24159	3	63	11621133nn1@stu.gdou.edu.cn	11621133nn1@stu.gdou.edu.cn	NUM
fcis-24159	3	64	)	)	PUNCT
fcis-24159	3	65	abstract	abstract	NOUN
fcis-24159	3	66	:	:	PUNCT
fcis-24159	3	67	learning	learn	VERB
fcis-24159	3	68	algorithm	algorithm	NOUN
fcis-24159	3	69	design	design	NOUN
fcis-24159	3	70	and	and	CCONJ
fcis-24159	3	71	analysis	analysis	NOUN
fcis-24159	3	72	is	be	AUX
fcis-24159	3	73	an	an	DET
fcis-24159	3	74	essential	essential	ADJ
fcis-24159	3	75	foundation	foundation	NOUN
fcis-24159	3	76	for	for	ADP
fcis-24159	3	77	computational	computational	ADJ
fcis-24159	3	78	problem	problem	NOUN
fcis-24159	3	79	-	-	PUNCT
fcis-24159	3	80	solving	solve	VERB
fcis-24159	3	81	and	and	CCONJ
fcis-24159	3	82	programming	programming	NOUN
fcis-24159	3	83	.	.	PUNCT
fcis-24159	4	1	it	it	PRON
fcis-24159	4	2	can	can	AUX
fcis-24159	4	3	cultivate	cultivate	VERB
fcis-24159	4	4	students	student	NOUN
fcis-24159	4	5	'	'	PART
fcis-24159	4	6	analytical	analytical	ADJ
fcis-24159	4	7	and	and	CCONJ
fcis-24159	4	8	problem	problem	NOUN
fcis-24159	4	9	-	-	PUNCT
fcis-24159	4	10	solving	solve	VERB
fcis-24159	4	11	skills	skill	NOUN
fcis-24159	4	12	,	,	PUNCT
fcis-24159	4	13	logical	logical	ADJ
fcis-24159	4	14	thinking	thinking	NOUN
fcis-24159	4	15	skills	skill	NOUN
fcis-24159	4	16	and	and	CCONJ
fcis-24159	4	17	creativity	creativity	NOUN
fcis-24159	4	18	.	.	PUNCT
fcis-24159	5	1	this	this	DET
fcis-24159	5	2	paper	paper	NOUN
fcis-24159	5	3	shows	show	VERB
fcis-24159	5	4	the	the	DET
fcis-24159	5	5	core	core	NOUN
fcis-24159	5	6	ideas	idea	NOUN
fcis-24159	5	7	of	of	ADP
fcis-24159	5	8	recursive	recursive	ADJ
fcis-24159	5	9	algorithms	algorithm	NOUN
fcis-24159	5	10	and	and	CCONJ
fcis-24159	5	11	partitioning	partition	VERB
fcis-24159	5	12	algorithms	algorithm	NOUN
fcis-24159	5	13	and	and	CCONJ
fcis-24159	5	14	python	python	NOUN
fcis-24159	5	15	examples	example	NOUN
fcis-24159	5	16	in	in	ADP
fcis-24159	5	17	conjunction	conjunction	NOUN
fcis-24159	5	18	with	with	ADP
fcis-24159	5	19	python	python	PROPN
fcis-24159	5	20	,	,	PUNCT
fcis-24159	5	21	a	a	DET
fcis-24159	5	22	popular	popular	ADJ
fcis-24159	5	23	programming	programming	NOUN
fcis-24159	5	24	language	language	NOUN
fcis-24159	5	25	,	,	PUNCT
fcis-24159	5	26	to	to	PART
fcis-24159	5	27	provide	provide	VERB
fcis-24159	5	28	adequate	adequate	ADJ
fcis-24159	5	29	references	reference	NOUN
fcis-24159	5	30	for	for	ADP
fcis-24159	5	31	teachers	teacher	NOUN
fcis-24159	5	32	and	and	CCONJ
fcis-24159	5	33	students	student	NOUN
fcis-24159	5	34	to	to	PART
fcis-24159	5	35	learn	learn	VERB
fcis-24159	5	36	algorithm	algorithm	NOUN
fcis-24159	5	37	design	design	NOUN
fcis-24159	5	38	and	and	CCONJ
fcis-24159	5	39	analysis	analysis	NOUN
fcis-24159	5	40	based	base	VERB
fcis-24159	5	41	on	on	ADP
fcis-24159	5	42	the	the	DET
fcis-24159	5	43	python	python	NOUN
fcis-24159	5	44	language	language	NOUN
fcis-24159	5	45	.	.	PUNCT
fcis-24159	6	1	keywords	keyword	NOUN
fcis-24159	6	2	:	:	PUNCT
fcis-24159	6	3	algorithm	algorithm	NOUN
fcis-24159	6	4	design	design	NOUN
fcis-24159	6	5	and	and	CCONJ
fcis-24159	6	6	analysis	analysis	NOUN
fcis-24159	6	7	;	;	PUNCT
fcis-24159	6	8	experimental	experimental	ADJ
fcis-24159	6	9	teaching	teaching	NOUN
fcis-24159	6	10	;	;	PUNCT
fcis-24159	6	11	recursive	recursive	ADJ
fcis-24159	6	12	algorithm	algorithm	NOUN
fcis-24159	6	13	;	;	PUNCT
fcis-24159	6	14	partitioning	partition	VERB
fcis-24159	6	15	algorithm	algorithm	NOUN
fcis-24159	6	16	.	.	PUNCT
fcis-24159	7	1	1	1	X
fcis-24159	7	2	.	.	X
fcis-24159	7	3	introduction	introduction	NOUN
fcis-24159	7	4	with	with	ADP
fcis-24159	7	5	the	the	DET
fcis-24159	7	6	rise	rise	NOUN
fcis-24159	7	7	of	of	ADP
fcis-24159	7	8	research	research	NOUN
fcis-24159	7	9	fields	field	NOUN
fcis-24159	7	10	such	such	ADJ
fcis-24159	7	11	as	as	ADP
fcis-24159	7	12	big	big	ADJ
fcis-24159	7	13	data	datum	NOUN
fcis-24159	7	14	and	and	CCONJ
fcis-24159	7	15	artificial	artificial	ADJ
fcis-24159	7	16	intelligence	intelligence	NOUN
fcis-24159	7	17	,	,	PUNCT
fcis-24159	7	18	python	python	PROPN
fcis-24159	7	19	has	have	AUX
fcis-24159	7	20	also	also	ADV
fcis-24159	7	21	become	become	VERB
fcis-24159	7	22	popular	popular	ADJ
fcis-24159	7	23	recently	recently	ADV
fcis-24159	7	24	.	.	PUNCT
fcis-24159	8	1	python	python	PROPN
fcis-24159	8	2	is	be	AUX
fcis-24159	8	3	a	a	DET
fcis-24159	8	4	widely	widely	ADV
fcis-24159	8	5	used	use	VERB
fcis-24159	8	6	interpreted	interpret	VERB
fcis-24159	8	7	,	,	PUNCT
fcis-24159	8	8	high	high	ADJ
fcis-24159	8	9	-	-	PUNCT
fcis-24159	8	10	level	level	NOUN
fcis-24159	8	11	,	,	PUNCT
fcis-24159	8	12	and	and	CCONJ
fcis-24159	8	13	general	general	ADJ
fcis-24159	8	14	-	-	PUNCT
fcis-24159	8	15	purpose	purpose	NOUN
fcis-24159	8	16	programming	programming	NOUN
fcis-24159	8	17	language	language	NOUN
fcis-24159	8	18	.	.	PUNCT
fcis-24159	9	1	python	python	PROPN
fcis-24159	9	2	emphasizes	emphasize	VERB
fcis-24159	9	3	the	the	DET
fcis-24159	9	4	readability	readability	NOUN
fcis-24159	9	5	of	of	ADP
fcis-24159	9	6	code	code	NOUN
fcis-24159	9	7	and	and	CCONJ
fcis-24159	9	8	concise	concise	ADJ
fcis-24159	9	9	syntax	syntax	NOUN
fcis-24159	9	10	,	,	PUNCT
fcis-24159	9	11	making	make	VERB
fcis-24159	9	12	it	it	PRON
fcis-24159	9	13	relatively	relatively	ADV
fcis-24159	9	14	easy	easy	ADJ
fcis-24159	9	15	to	to	PART
fcis-24159	9	16	learn	learn	VERB
fcis-24159	9	17	,	,	PUNCT
fcis-24159	9	18	and	and	CCONJ
fcis-24159	9	19	with	with	ADP
fcis-24159	9	20	a	a	DET
fcis-24159	9	21	low	low	ADJ
fcis-24159	9	22	learning	learning	NOUN
fcis-24159	9	23	cost	cost	NOUN
fcis-24159	9	24	,	,	PUNCT
fcis-24159	9	25	it	it	PRON
fcis-24159	9	26	is	be	AUX
fcis-24159	9	27	one	one	NUM
fcis-24159	9	28	of	of	ADP
fcis-24159	9	29	the	the	DET
fcis-24159	9	30	most	most	ADV
fcis-24159	9	31	popular	popular	ADJ
fcis-24159	9	32	programming	programming	NOUN
fcis-24159	9	33	languages	language	NOUN
fcis-24159	9	34	.	.	PUNCT
fcis-24159	10	1	however	however	ADV
fcis-24159	10	2	,	,	PUNCT
fcis-24159	10	3	to	to	ADP
fcis-24159	10	4	date	date	NOUN
fcis-24159	10	5	,	,	PUNCT
fcis-24159	10	6	there	there	PRON
fcis-24159	10	7	are	be	VERB
fcis-24159	10	8	still	still	ADV
fcis-24159	10	9	relatively	relatively	ADV
fcis-24159	10	10	few	few	ADJ
fcis-24159	10	11	courses	course	NOUN
fcis-24159	10	12	related	relate	VERB
fcis-24159	10	13	to	to	ADP
fcis-24159	10	14	the	the	DET
fcis-24159	10	15	python	python	NOUN
fcis-24159	10	16	language	language	NOUN
fcis-24159	10	17	offered	offer	VERB
fcis-24159	10	18	in	in	ADP
fcis-24159	10	19	chinese	chinese	ADJ
fcis-24159	10	20	universities	university	NOUN
fcis-24159	10	21	,	,	PUNCT
fcis-24159	10	22	especially	especially	ADV
fcis-24159	10	23	some	some	DET
fcis-24159	10	24	core	core	ADJ
fcis-24159	10	25	introductory	introductory	ADJ
fcis-24159	10	26	courses	course	NOUN
fcis-24159	10	27	in	in	ADP
fcis-24159	10	28	the	the	DET
fcis-24159	10	29	field	field	NOUN
fcis-24159	10	30	of	of	ADP
fcis-24159	10	31	computer	computer	NOUN
fcis-24159	10	32	science	science	NOUN
fcis-24159	10	33	and	and	CCONJ
fcis-24159	10	34	technology	technology	NOUN
fcis-24159	10	35	,	,	PUNCT
fcis-24159	10	36	such	such	ADJ
fcis-24159	10	37	as	as	ADP
fcis-24159	10	38	"	"	PUNCT
fcis-24159	10	39	data	datum	NOUN
fcis-24159	10	40	structures	structure	NOUN
fcis-24159	10	41	"	"	PUNCT
fcis-24159	10	42	and	and	CCONJ
fcis-24159	10	43	"	"	PUNCT
fcis-24159	10	44	algorithm	algorithm	NOUN
fcis-24159	10	45	analysis	analysis	NOUN
fcis-24159	10	46	and	and	CCONJ
fcis-24159	10	47	design	design	NOUN
fcis-24159	10	48	,	,	PUNCT
fcis-24159	10	49	"	"	PUNCT
fcis-24159	10	50	which	which	PRON
fcis-24159	10	51	are	be	AUX
fcis-24159	10	52	primarily	primarily	ADV
fcis-24159	10	53	implemented	implement	VERB
fcis-24159	10	54	in	in	ADP
fcis-24159	10	55	java	java	PROPN
fcis-24159	10	56	,	,	PUNCT
fcis-24159	10	57	c++	c++	NOUN
fcis-24159	10	58	,	,	PUNCT
fcis-24159	10	59	and	and	CCONJ
fcis-24159	10	60	c	c	NOUN
fcis-24159	10	61	languages	language	NOUN
fcis-24159	10	62	,	,	PUNCT
fcis-24159	10	63	while	while	SCONJ
fcis-24159	10	64	the	the	DET
fcis-24159	10	65	tutorial	tutorial	NOUN
fcis-24159	10	66	system	system	NOUN
fcis-24159	10	67	using	use	VERB
fcis-24159	10	68	python	python	NOUN
fcis-24159	10	69	as	as	ADP
fcis-24159	10	70	the	the	DET
fcis-24159	10	71	programming	programming	NOUN
fcis-24159	10	72	language	language	NOUN
fcis-24159	10	73	is	be	AUX
fcis-24159	10	74	in	in	ADP
fcis-24159	10	75	urgent	urgent	ADJ
fcis-24159	10	76	need	need	NOUN
fcis-24159	10	77	of	of	ADP
fcis-24159	10	78	improvement	improvement	NOUN
fcis-24159	10	79	[	[	X
fcis-24159	10	80	1	1	NUM
fcis-24159	10	81	]	]	PUNCT
fcis-24159	10	82	.	.	PUNCT
fcis-24159	11	1	this	this	DET
fcis-24159	11	2	paper	paper	NOUN
fcis-24159	11	3	focuses	focus	VERB
fcis-24159	11	4	on	on	ADP
fcis-24159	11	5	the	the	DET
fcis-24159	11	6	"	"	PUNCT
fcis-24159	11	7	algorithm	algorithm	NOUN
fcis-24159	11	8	analysis	analysis	NOUN
fcis-24159	11	9	and	and	CCONJ
fcis-24159	11	10	design	design	NOUN
fcis-24159	11	11	"	"	PUNCT
fcis-24159	11	12	course	course	NOUN
fcis-24159	11	13	and	and	CCONJ
fcis-24159	11	14	designs	design	VERB
fcis-24159	11	15	experimental	experimental	ADJ
fcis-24159	11	16	teaching	teaching	NOUN
fcis-24159	11	17	examples	example	NOUN
fcis-24159	11	18	using	use	VERB
fcis-24159	11	19	python	python	NOUN
fcis-24159	11	20	.	.	PUNCT
fcis-24159	12	1	the	the	DET
fcis-24159	12	2	paper	paper	NOUN
fcis-24159	12	3	provides	provide	VERB
fcis-24159	12	4	the	the	DET
fcis-24159	12	5	core	core	NOUN
fcis-24159	12	6	ideas	idea	NOUN
fcis-24159	12	7	of	of	ADP
fcis-24159	12	8	recursive	recursive	ADJ
fcis-24159	12	9	algorithms	algorithm	NOUN
fcis-24159	12	10	and	and	CCONJ
fcis-24159	12	11	divide	divide	NOUN
fcis-24159	12	12	-	-	PUNCT
fcis-24159	12	13	and	and	CCONJ
fcis-24159	12	14	-	-	PUNCT
fcis-24159	12	15	conquer	conquer	NOUN
fcis-24159	12	16	algorithms	algorithm	NOUN
fcis-24159	12	17	,	,	PUNCT
fcis-24159	12	18	as	as	ADV
fcis-24159	12	19	well	well	ADV
fcis-24159	12	20	as	as	ADP
fcis-24159	12	21	python	python	NOUN
fcis-24159	12	22	examples	example	NOUN
fcis-24159	12	23	.	.	PUNCT
fcis-24159	13	1	these	these	DET
fcis-24159	13	2	examples	example	NOUN
fcis-24159	13	3	are	be	AUX
fcis-24159	13	4	practical	practical	ADJ
fcis-24159	13	5	and	and	CCONJ
fcis-24159	13	6	typical	typical	ADJ
fcis-24159	13	7	,	,	PUNCT
fcis-24159	13	8	and	and	CCONJ
fcis-24159	13	9	the	the	DET
fcis-24159	13	10	reference	reference	NOUN
fcis-24159	13	11	programs	program	NOUN
fcis-24159	13	12	provided	provide	VERB
fcis-24159	13	13	are	be	AUX
fcis-24159	13	14	complete	complete	ADJ
fcis-24159	13	15	,	,	PUNCT
fcis-24159	13	16	providing	provide	VERB
fcis-24159	13	17	a	a	DET
fcis-24159	13	18	solid	solid	ADJ
fcis-24159	13	19	reference	reference	NOUN
fcis-24159	13	20	for	for	ADP
fcis-24159	13	21	teachers	teacher	NOUN
fcis-24159	13	22	and	and	CCONJ
fcis-24159	13	23	students	student	NOUN
fcis-24159	13	24	to	to	PART
fcis-24159	13	25	learn	learn	VERB
fcis-24159	13	26	this	this	DET
fcis-24159	13	27	course	course	NOUN
fcis-24159	13	28	.	.	PUNCT
fcis-24159	14	1	2	2	X
fcis-24159	14	2	.	.	X
fcis-24159	14	3	recursive	recursive	ADJ
fcis-24159	14	4	algorithm	algorithm	NOUN
fcis-24159	14	5	recursive	recursive	ADJ
fcis-24159	14	6	algorithms	algorithm	NOUN
fcis-24159	14	7	involve	involve	VERB
fcis-24159	14	8	a	a	DET
fcis-24159	14	9	function	function	NOUN
fcis-24159	14	10	or	or	CCONJ
fcis-24159	14	11	process	process	NOUN
fcis-24159	14	12	calling	call	VERB
fcis-24159	14	13	itself	itself	PRON
fcis-24159	14	14	,	,	PUNCT
fcis-24159	14	15	which	which	PRON
fcis-24159	14	16	can	can	AUX
fcis-24159	14	17	be	be	AUX
fcis-24159	14	18	either	either	CCONJ
fcis-24159	14	19	direct	direct	ADJ
fcis-24159	14	20	or	or	CCONJ
fcis-24159	14	21	indirect	indirect	ADJ
fcis-24159	14	22	recursion	recursion	NOUN
fcis-24159	14	23	.	.	PUNCT
fcis-24159	15	1	it	it	PRON
fcis-24159	15	2	is	be	AUX
fcis-24159	15	3	one	one	NUM
fcis-24159	15	4	of	of	ADP
fcis-24159	15	5	the	the	DET
fcis-24159	15	6	core	core	NOUN
fcis-24159	15	7	technical	technical	ADJ
fcis-24159	15	8	ideas	idea	NOUN
fcis-24159	15	9	in	in	ADP
fcis-24159	15	10	computer	computer	NOUN
fcis-24159	15	11	science	science	NOUN
fcis-24159	15	12	,	,	PUNCT
fcis-24159	15	13	reflecting	reflect	VERB
fcis-24159	15	14	a	a	DET
fcis-24159	15	15	way	way	NOUN
fcis-24159	15	16	of	of	ADP
fcis-24159	15	17	thinking	thinking	NOUN
fcis-24159	15	18	that	that	SCONJ
fcis-24159	15	19	simplifies	simplifie	NOUN
fcis-24159	15	20	complex	complex	ADJ
fcis-24159	15	21	problems	problem	NOUN
fcis-24159	15	22	[	[	X
fcis-24159	15	23	2	2	NUM
fcis-24159	15	24	]	]	PUNCT
fcis-24159	15	25	.	.	PUNCT
fcis-24159	16	1	the	the	DET
fcis-24159	16	2	characteristic	characteristic	NOUN
fcis-24159	16	3	of	of	ADP
fcis-24159	16	4	recursive	recursive	ADJ
fcis-24159	16	5	algorithms	algorithm	NOUN
fcis-24159	16	6	is	be	AUX
fcis-24159	16	7	that	that	SCONJ
fcis-24159	16	8	they	they	PRON
fcis-24159	16	9	can	can	AUX
fcis-24159	16	10	decompose	decompose	VERB
fcis-24159	16	11	complex	complex	ADJ
fcis-24159	16	12	problems	problem	NOUN
fcis-24159	16	13	into	into	ADP
fcis-24159	16	14	simpler	simple	ADJ
fcis-24159	16	15	sub	sub	NOUN
fcis-24159	16	16	-	-	NOUN
fcis-24159	16	17	problems	problem	NOUN
fcis-24159	16	18	.	.	PUNCT
fcis-24159	17	1	these	these	DET
fcis-24159	17	2	sub	sub	NOUN
fcis-24159	17	3	-	-	NOUN
fcis-24159	17	4	problems	problem	NOUN
fcis-24159	17	5	have	have	VERB
fcis-24159	17	6	the	the	DET
fcis-24159	17	7	same	same	ADJ
fcis-24159	17	8	nature	nature	NOUN
fcis-24159	17	9	and	and	CCONJ
fcis-24159	17	10	form	form	NOUN
fcis-24159	17	11	as	as	ADP
fcis-24159	17	12	the	the	DET
fcis-24159	17	13	original	original	ADJ
fcis-24159	17	14	problem	problem	NOUN
fcis-24159	17	15	but	but	CCONJ
fcis-24159	17	16	are	be	AUX
fcis-24159	17	17	smaller	small	ADJ
fcis-24159	17	18	in	in	ADP
fcis-24159	17	19	scale	scale	NOUN
fcis-24159	17	20	and	and	CCONJ
fcis-24159	17	21	,	,	PUNCT
fcis-24159	17	22	thus	thus	ADV
fcis-24159	17	23	,	,	PUNCT
fcis-24159	17	24	more	more	ADV
fcis-24159	17	25	accessible	accessible	ADJ
fcis-24159	17	26	to	to	PART
fcis-24159	17	27	solve	solve	VERB
fcis-24159	17	28	[	[	X
fcis-24159	17	29	3	3	NUM
fcis-24159	17	30	]	]	PUNCT
fcis-24159	17	31	.	.	PUNCT
fcis-24159	18	1	recursive	recursive	ADJ
fcis-24159	18	2	algorithms	algorithm	NOUN
fcis-24159	18	3	have	have	VERB
fcis-24159	18	4	two	two	NUM
fcis-24159	18	5	fundamental	fundamental	ADJ
fcis-24159	18	6	components	component	NOUN
fcis-24159	18	7	:	:	PUNCT
fcis-24159	18	8	(	(	PUNCT
fcis-24159	18	9	1	1	X
fcis-24159	18	10	)	)	PUNCT
fcis-24159	18	11	there	there	PRON
fcis-24159	18	12	must	must	AUX
fcis-24159	18	13	be	be	AUX
fcis-24159	18	14	a	a	DET
fcis-24159	18	15	base	base	NOUN
fcis-24159	18	16	case	case	NOUN
fcis-24159	18	17	that	that	PRON
fcis-24159	18	18	stops	stop	VERB
fcis-24159	18	19	the	the	DET
fcis-24159	18	20	recursion	recursion	NOUN
fcis-24159	18	21	,	,	PUNCT
fcis-24159	18	22	i.e.	i.e.	X
fcis-24159	18	23	,	,	PUNCT
fcis-24159	18	24	the	the	DET
fcis-24159	18	25	exit	exit	NOUN
fcis-24159	18	26	condition	condition	NOUN
fcis-24159	18	27	of	of	ADP
fcis-24159	18	28	recursion	recursion	NOUN
fcis-24159	18	29	;	;	PUNCT
fcis-24159	18	30	(	(	PUNCT
fcis-24159	18	31	2	2	X
fcis-24159	18	32	)	)	PUNCT
fcis-24159	18	33	there	there	PRON
fcis-24159	18	34	must	must	AUX
fcis-24159	18	35	be	be	AUX
fcis-24159	18	36	a	a	DET
fcis-24159	18	37	recursive	recursive	ADJ
fcis-24159	18	38	structure	structure	NOUN
fcis-24159	18	39	consistent	consistent	ADJ
fcis-24159	18	40	with	with	ADP
fcis-24159	18	41	the	the	DET
fcis-24159	18	42	original	original	ADJ
fcis-24159	18	43	problem	problem	NOUN
fcis-24159	18	44	's	's	PART
fcis-24159	18	45	structure	structure	NOUN
fcis-24159	18	46	but	but	CCONJ
fcis-24159	18	47	a	a	DET
fcis-24159	18	48	smaller	small	ADJ
fcis-24159	18	49	input	input	NOUN
fcis-24159	18	50	size	size	NOUN
fcis-24159	18	51	than	than	ADP
fcis-24159	18	52	the	the	DET
fcis-24159	18	53	original	original	ADJ
fcis-24159	18	54	problem	problem	NOUN
fcis-24159	18	55	.	.	PUNCT
fcis-24159	19	1	example	example	NOUN
fcis-24159	19	2	problem	problem	NOUN
fcis-24159	19	3	:	:	PUNCT
fcis-24159	19	4	the	the	DET
fcis-24159	19	5	fibonacci	fibonacci	NOUN
fcis-24159	19	6	sequence	sequence	NOUN
fcis-24159	19	7	,	,	PUNCT
fcis-24159	19	8	derived	derive	VERB
fcis-24159	19	9	from	from	ADP
fcis-24159	19	10	a	a	DET
fcis-24159	19	11	rabbit	rabbit	NOUN
fcis-24159	19	12	breeding	breeding	NOUN
fcis-24159	19	13	problem	problem	NOUN
fcis-24159	19	14	in	in	ADP
fcis-24159	19	15	the	the	DET
fcis-24159	19	16	famous	famous	ADJ
fcis-24159	19	17	work	work	NOUN
fcis-24159	19	18	"	"	PUNCT
fcis-24159	19	19	liber	liber	NOUN
fcis-24159	19	20	abaci	abaci	NOUN
fcis-24159	19	21	"	"	PUNCT
fcis-24159	19	22	by	by	ADP
fcis-24159	19	23	the	the	DET
fcis-24159	19	24	italian	italian	ADJ
fcis-24159	19	25	mathematician	mathematician	ADJ
fcis-24159	19	26	fibonacci	fibonacci	NOUN
fcis-24159	19	27	,	,	PUNCT
fcis-24159	19	28	is	be	AUX
fcis-24159	19	29	a	a	DET
fcis-24159	19	30	sequence	sequence	NOUN
fcis-24159	19	31	:	:	PUNCT
fcis-24159	19	32	1	1	NUM
fcis-24159	19	33	,	,	PUNCT
fcis-24159	19	34	1	1	NUM
fcis-24159	19	35	,	,	PUNCT
fcis-24159	19	36	2	2	NUM
fcis-24159	19	37	,	,	PUNCT
fcis-24159	19	38	3	3	NUM
fcis-24159	19	39	,	,	PUNCT
fcis-24159	19	40	5	5	NUM
fcis-24159	19	41	,	,	PUNCT
fcis-24159	19	42	8	8	NUM
fcis-24159	19	43	,	,	PUNCT
fcis-24159	19	44	13	13	NUM
fcis-24159	19	45	,	,	PUNCT
fcis-24159	19	46	21	21	NUM
fcis-24159	19	47	,	,	PUNCT
fcis-24159	19	48	34	34	NUM
fcis-24159	19	49	...	...	PUNCT
fcis-24159	19	50	that	that	PRON
fcis-24159	19	51	is	be	AUX
fcis-24159	19	52	,	,	PUNCT
fcis-24159	19	53	except	except	SCONJ
fcis-24159	19	54	for	for	ADP
fcis-24159	19	55	the	the	DET
fcis-24159	19	56	first	first	ADJ
fcis-24159	19	57	two	two	NUM
fcis-24159	19	58	numbers	number	NOUN
fcis-24159	19	59	,	,	PUNCT
fcis-24159	19	60	which	which	PRON
fcis-24159	19	61	are	be	AUX
fcis-24159	19	62	both	both	PRON
fcis-24159	19	63	1	1	NUM
fcis-24159	19	64	,	,	PUNCT
fcis-24159	19	65	from	from	ADP
fcis-24159	19	66	the	the	DET
fcis-24159	19	67	third	third	ADJ
fcis-24159	19	68	number	number	NOUN
fcis-24159	19	69	onwards	onwards	ADV
fcis-24159	19	70	,	,	PUNCT
fcis-24159	19	71	each	each	DET
fcis-24159	19	72	number	number	NOUN
fcis-24159	19	73	is	be	AUX
fcis-24159	19	74	the	the	DET
fcis-24159	19	75	sum	sum	NOUN
fcis-24159	19	76	of	of	ADP
fcis-24159	19	77	the	the	DET
fcis-24159	19	78	two	two	NUM
fcis-24159	19	79	preceding	precede	VERB
fcis-24159	19	80	numbers	number	NOUN
fcis-24159	19	81	.	.	PUNCT
fcis-24159	20	1	find	find	VERB
fcis-24159	20	2	the	the	DET
fcis-24159	20	3	value	value	NOUN
fcis-24159	20	4	of	of	ADP
fcis-24159	20	5	the	the	DET
fcis-24159	20	6	fibonacci	fibonacci	NOUN
fcis-24159	20	7	sequence	sequence	NOUN
fcis-24159	20	8	when	when	SCONJ
fcis-24159	20	9	n=34	n=34	PROPN
fcis-24159	20	10	.	.	PUNCT
fcis-24159	21	1	problem	problem	NOUN
fcis-24159	21	2	analysis	analysis	NOUN
fcis-24159	21	3	:	:	PUNCT
fcis-24159	21	4	firstly	firstly	ADV
fcis-24159	21	5	,	,	PUNCT
fcis-24159	21	6	we	we	PRON
fcis-24159	21	7	know	know	VERB
fcis-24159	21	8	the	the	DET
fcis-24159	21	9	general	general	ADJ
fcis-24159	21	10	formula	formula	NOUN
fcis-24159	21	11	for	for	ADP
fcis-24159	21	12	the	the	DET
fcis-24159	21	13	fibonacci	fibonacci	NOUN
fcis-24159	21	14	sequence	sequence	NOUN
fcis-24159	21	15	is	be	AUX
fcis-24159	21	16	:	:	PUNCT
fcis-24159	21	17	f	f	PROPN
fcis-24159	21	18	n	n	CCONJ
fcis-24159	21	19	0	0	NUM
fcis-24159	22	1	n	n	NOUN
fcis-24159	22	2	0	0	NUM
fcis-24159	22	3	f	f	PROPN
fcis-24159	22	4	n	n	CCONJ
fcis-24159	22	5	1	1	NUM
fcis-24159	22	6	n	n	NUM
fcis-24159	22	7	1	1	NUM
fcis-24159	22	8	f	f	NOUN
fcis-24159	22	9	n	n	ADP
fcis-24159	22	10	f	f	PROPN
fcis-24159	22	11	n	n	PROPN
fcis-24159	22	12	1	1	NUM
fcis-24159	22	13	f	f	NOUN
fcis-24159	22	14	n	n	ADP
fcis-24159	22	15	2	2	NUM
fcis-24159	22	16	n	n	SYM
fcis-24159	22	17	2	2	NUM
fcis-24159	22	18	n	n	NOUN
fcis-24159	22	19	∈	∈	NOUN
fcis-24159	22	20	n	n	X
fcis-24159	22	21	for	for	ADP
fcis-24159	22	22	n	n	CCONJ
fcis-24159	22	23	less	less	ADJ
fcis-24159	22	24	than	than	ADP
fcis-24159	22	25	or	or	CCONJ
fcis-24159	22	26	equal	equal	ADJ
fcis-24159	22	27	to	to	ADP
fcis-24159	22	28	1	1	NUM
fcis-24159	22	29	,	,	PUNCT
fcis-24159	22	30	we	we	PRON
fcis-24159	22	31	directly	directly	ADV
fcis-24159	22	32	return	return	VERB
fcis-24159	22	33	the	the	DET
fcis-24159	22	34	f(n	f(n	PROPN
fcis-24159	22	35	)	)	PUNCT
fcis-24159	22	36	value	value	NOUN
fcis-24159	22	37	.	.	PUNCT
fcis-24159	23	1	for	for	ADP
fcis-24159	23	2	n	n	X
fcis-24159	23	3	greater	great	ADJ
fcis-24159	23	4	than	than	ADP
fcis-24159	23	5	or	or	CCONJ
fcis-24159	23	6	equal	equal	ADJ
fcis-24159	23	7	to	to	ADP
fcis-24159	23	8	2	2	NUM
fcis-24159	23	9	,	,	PUNCT
fcis-24159	23	10	we	we	PRON
fcis-24159	23	11	recursively	recursively	ADV
fcis-24159	23	12	calculate	calculate	VERB
fcis-24159	23	13	the	the	DET
fcis-24159	23	14	values	value	NOUN
fcis-24159	23	15	of	of	ADP
fcis-24159	23	16	f(n-1	f(n-1	NOUN
fcis-24159	23	17	)	)	PUNCT
fcis-24159	23	18	and	and	CCONJ
fcis-24159	23	19	f(n-2	f(n-2	NOUN
fcis-24159	23	20	)	)	PUNCT
fcis-24159	23	21	,	,	PUNCT
fcis-24159	23	22	and	and	CCONJ
fcis-24159	23	23	after	after	ADP
fcis-24159	23	24	computing	compute	VERB
fcis-24159	23	25	the	the	DET
fcis-24159	23	26	values	value	NOUN
fcis-24159	23	27	of	of	ADP
fcis-24159	23	28	f(n-1	f(n-1	NOUN
fcis-24159	23	29	)	)	PUNCT
fcis-24159	23	30	and	and	CCONJ
fcis-24159	23	31	f(n-2	f(n-2	NOUN
fcis-24159	23	32	)	)	PUNCT
fcis-24159	23	33	,	,	PUNCT
fcis-24159	23	34	we	we	PRON
fcis-24159	23	35	return	return	VERB
fcis-24159	23	36	the	the	DET
fcis-24159	23	37	value	value	NOUN
fcis-24159	23	38	of	of	ADP
fcis-24159	23	39	f(n	f(n	PROPN
fcis-24159	23	40	)	)	PUNCT
fcis-24159	23	41	.	.	PUNCT
fcis-24159	24	1	the	the	DET
fcis-24159	24	2	program	program	NOUN
fcis-24159	24	3	and	and	CCONJ
fcis-24159	24	4	the	the	DET
fcis-24159	24	5	running	running	NOUN
fcis-24159	24	6	result	result	NOUN
fcis-24159	24	7	are	be	AUX
fcis-24159	24	8	shown	show	VERB
fcis-24159	24	9	in	in	ADP
fcis-24159	24	10	figure	figure	NOUN
fcis-24159	24	11	1	1	NUM
fcis-24159	24	12	.	.	PUNCT
fcis-24159	24	13	considerations	consideration	NOUN
fcis-24159	24	14	for	for	ADP
fcis-24159	24	15	using	use	VERB
fcis-24159	24	16	recursive	recursive	ADJ
fcis-24159	24	17	algorithms	algorithm	NOUN
fcis-24159	24	18	:	:	PUNCT
fcis-24159	24	19	recursion	recursion	NOUN
fcis-24159	24	20	is	be	AUX
fcis-24159	24	21	defining	define	VERB
fcis-24159	24	22	a	a	DET
fcis-24159	24	23	problem	problem	NOUN
fcis-24159	24	24	or	or	CCONJ
fcis-24159	24	25	its	its	PRON
fcis-24159	24	26	solution	solution	NOUN
fcis-24159	24	27	based	base	VERB
fcis-24159	24	28	on	on	ADP
fcis-24159	24	29	a	a	DET
fcis-24159	24	30	simplified	simplified	ADJ
fcis-24159	24	31	version	version	NOUN
fcis-24159	24	32	of	of	ADP
fcis-24159	24	33	the	the	DET
fcis-24159	24	34	problem	problem	NOUN
fcis-24159	24	35	[	[	X
fcis-24159	24	36	4	4	NUM
fcis-24159	24	37	]	]	PUNCT
fcis-24159	24	38	.	.	PUNCT
fcis-24159	25	1	therefore	therefore	ADV
fcis-24159	25	2	,	,	PUNCT
fcis-24159	25	3	when	when	SCONJ
fcis-24159	25	4	defining	define	VERB
fcis-24159	25	5	and	and	CCONJ
fcis-24159	25	6	solving	solve	VERB
fcis-24159	25	7	sub	sub	NOUN
fcis-24159	25	8	-	-	NOUN
fcis-24159	25	9	problems	problem	NOUN
fcis-24159	25	10	,	,	PUNCT
fcis-24159	25	11	the	the	DET
fcis-24159	25	12	method	method	NOUN
fcis-24159	25	13	of	of	ADP
fcis-24159	25	14	solving	solve	VERB
fcis-24159	25	15	the	the	DET
fcis-24159	25	16	sub	sub	NOUN
fcis-24159	25	17	-	-	NOUN
fcis-24159	25	18	problems	problem	NOUN
fcis-24159	25	19	must	must	AUX
fcis-24159	25	20	be	be	AUX
fcis-24159	25	21	consistent	consistent	ADJ
fcis-24159	25	22	with	with	ADP
fcis-24159	25	23	the	the	DET
fcis-24159	25	24	original	original	ADJ
fcis-24159	25	25	problem	problem	NOUN
fcis-24159	25	26	.	.	PUNCT
fcis-24159	26	1	using	use	VERB
fcis-24159	26	2	recursion	recursion	NOUN
fcis-24159	26	3	requires	require	VERB
fcis-24159	26	4	memory	memory	NOUN
fcis-24159	26	5	space	space	NOUN
fcis-24159	26	6	from	from	ADP
fcis-24159	26	7	the	the	DET
fcis-24159	26	8	stack	stack	NOUN
fcis-24159	26	9	.	.	PUNCT
fcis-24159	27	1	if	if	SCONJ
fcis-24159	27	2	the	the	DET
fcis-24159	27	3	recursion	recursion	NOUN
fcis-24159	27	4	is	be	AUX
fcis-24159	27	5	too	too	ADV
fcis-24159	27	6	deep	deep	ADJ
fcis-24159	27	7	,	,	PUNCT
fcis-24159	27	8	it	it	PRON
fcis-24159	27	9	will	will	AUX
fcis-24159	27	10	consume	consume	VERB
fcis-24159	27	11	too	too	ADV
fcis-24159	27	12	much	much	ADJ
fcis-24159	27	13	stack	stack	NOUN
fcis-24159	27	14	space	space	NOUN
fcis-24159	27	15	,	,	PUNCT
fcis-24159	27	16	which	which	PRON
fcis-24159	27	17	has	have	VERB
fcis-24159	27	18	high	high	ADJ
fcis-24159	27	19	memory	memory	NOUN
fcis-24159	27	20	requirements	requirement	NOUN
fcis-24159	27	21	and	and	CCONJ
fcis-24159	27	22	thus	thus	ADV
fcis-24159	27	23	reduces	reduce	VERB
fcis-24159	27	24	the	the	DET
fcis-24159	27	25	efficiency	efficiency	NOUN
fcis-24159	27	26	of	of	ADP
fcis-24159	27	27	the	the	DET
fcis-24159	27	28	program	program	NOUN
fcis-24159	27	29	's	's	PART
fcis-24159	27	30	operation	operation	NOUN
fcis-24159	28	1	[	[	X
fcis-24159	28	2	5	5	NUM
fcis-24159	28	3	]	]	PUNCT
fcis-24159	28	4	.	.	PUNCT
fcis-24159	29	1	at	at	ADP
fcis-24159	29	2	the	the	DET
fcis-24159	29	3	same	same	ADJ
fcis-24159	29	4	time	time	NOUN
fcis-24159	29	5	,	,	PUNCT
fcis-24159	29	6	there	there	PRON
fcis-24159	29	7	is	be	VERB
fcis-24159	29	8	a	a	DET
fcis-24159	29	9	risk	risk	NOUN
fcis-24159	29	10	of	of	ADP
fcis-24159	29	11	stack	stack	NOUN
fcis-24159	29	12	overflow	overflow	NOUN
fcis-24159	29	13	.	.	PUNCT
fcis-24159	30	1	problems	problem	NOUN
fcis-24159	30	2	solved	solve	VERB
fcis-24159	30	3	through	through	ADP
fcis-24159	30	4	recursion	recursion	NOUN
fcis-24159	30	5	must	must	AUX
fcis-24159	30	6	be	be	AUX
fcis-24159	30	7	within	within	ADP
fcis-24159	30	8	the	the	DET
fcis-24159	30	9	scope	scope	NOUN
fcis-24159	30	10	of	of	ADP
fcis-24159	30	11	legitimate	legitimate	ADJ
fcis-24159	30	12	solutions	solution	NOUN
fcis-24159	30	13	.	.	PUNCT
fcis-24159	31	1	taking	take	VERB
fcis-24159	31	2	the	the	DET
fcis-24159	31	3	fibonacci	fibonacci	NOUN
fcis-24159	31	4	sequence	sequence	NOUN
fcis-24159	31	5	as	as	ADP
fcis-24159	31	6	an	an	DET
fcis-24159	31	7	example	example	NOUN
fcis-24159	31	8	,	,	PUNCT
fcis-24159	31	9	when	when	SCONJ
fcis-24159	31	10	n=-1	n=-1	PROPN
fcis-24159	31	11	,	,	PUNCT
fcis-24159	31	12	the	the	DET
fcis-24159	31	13	program	program	NOUN
fcis-24159	31	14	will	will	AUX
fcis-24159	31	15	return	return	VERB
fcis-24159	31	16	-1	-1	PUNCT
fcis-24159	31	17	,	,	PUNCT
fcis-24159	31	18	but	but	CCONJ
fcis-24159	31	19	in	in	ADP
fcis-24159	31	20	reality	reality	NOUN
fcis-24159	31	21	,	,	PUNCT
fcis-24159	31	22	the	the	DET
fcis-24159	31	23	problem	problem	NOUN
fcis-24159	31	24	does	do	AUX
fcis-24159	31	25	not	not	PART
fcis-24159	31	26	hold	hold	VERB
fcis-24159	31	27	and	and	CCONJ
fcis-24159	31	28	should	should	AUX
fcis-24159	31	29	prompt	prompt	VERB
fcis-24159	31	30	an	an	DET
fcis-24159	31	31	input	input	NOUN
fcis-24159	31	32	error	error	NOUN
fcis-24159	31	33	.	.	PUNCT
fcis-24159	32	1	therefore	therefore	ADV
fcis-24159	32	2	,	,	PUNCT
fcis-24159	32	3	before	before	ADP
fcis-24159	32	4	recursion	recursion	NOUN
fcis-24159	32	5	,	,	PUNCT
fcis-24159	32	6	the	the	DET
fcis-24159	32	7	program	program	NOUN
fcis-24159	32	8	needs	need	VERB
fcis-24159	32	9	to	to	PART
fcis-24159	32	10	validate	validate	VERB
fcis-24159	32	11	the	the	DET
fcis-24159	32	12	data	datum	NOUN
fcis-24159	32	13	.	.	PUNCT
fcis-24159	33	1	54	54	NUM
fcis-24159	33	2	figure	figure	NOUN
fcis-24159	33	3	1	1	NUM
fcis-24159	33	4	.	.	PUNCT
fcis-24159	34	1	fibonacci	fibonacci	NOUN
fcis-24159	34	2	sequence	sequence	NOUN
fcis-24159	34	3	3	3	NUM
fcis-24159	34	4	.	.	PUNCT
fcis-24159	35	1	partitioning	partition	VERB
fcis-24159	35	2	algorithm	algorithm	PROPN
fcis-24159	35	3	divide	divide	NOUN
fcis-24159	35	4	and	and	CCONJ
fcis-24159	35	5	conquer	conquer	NOUN
fcis-24159	35	6	is	be	AUX
fcis-24159	35	7	a	a	DET
fcis-24159	35	8	strategy	strategy	NOUN
fcis-24159	35	9	that	that	PRON
fcis-24159	35	10	involves	involve	VERB
fcis-24159	35	11	breaking	break	VERB
fcis-24159	35	12	down	down	ADP
fcis-24159	35	13	a	a	DET
fcis-24159	35	14	complex	complex	ADJ
fcis-24159	35	15	problem	problem	NOUN
fcis-24159	35	16	into	into	ADP
fcis-24159	35	17	equivalent	equivalent	ADJ
fcis-24159	35	18	smaller	small	ADJ
fcis-24159	35	19	subproblems	subproblem	NOUN
fcis-24159	35	20	,	,	PUNCT
fcis-24159	35	21	solving	solve	VERB
fcis-24159	35	22	each	each	PRON
fcis-24159	35	23	of	of	ADP
fcis-24159	35	24	them	they	PRON
fcis-24159	35	25	individually	individually	ADV
fcis-24159	35	26	,	,	PUNCT
fcis-24159	35	27	and	and	CCONJ
fcis-24159	35	28	then	then	ADV
fcis-24159	35	29	combining	combine	VERB
fcis-24159	35	30	the	the	DET
fcis-24159	35	31	solutions	solution	NOUN
fcis-24159	35	32	to	to	PART
fcis-24159	35	33	form	form	VERB
fcis-24159	35	34	the	the	DET
fcis-24159	35	35	solution	solution	NOUN
fcis-24159	35	36	to	to	ADP
fcis-24159	35	37	the	the	DET
fcis-24159	35	38	original	original	ADJ
fcis-24159	35	39	problem[6	problem[6	NOUN
fcis-24159	35	40	]	]	PUNCT
fcis-24159	35	41	.	.	PUNCT
fcis-24159	36	1	the	the	DET
fcis-24159	36	2	fundamental	fundamental	ADJ
fcis-24159	36	3	idea	idea	NOUN
fcis-24159	36	4	is	be	AUX
fcis-24159	36	5	to	to	PART
fcis-24159	36	6	directly	directly	ADV
fcis-24159	36	7	transform	transform	VERB
fcis-24159	36	8	a	a	DET
fcis-24159	36	9	complex	complex	ADJ
fcis-24159	36	10	problem	problem	NOUN
fcis-24159	36	11	into	into	ADP
fcis-24159	36	12	several	several	ADJ
fcis-24159	36	13	more	more	ADJ
fcis-24159	36	14	minor	minor	ADJ
fcis-24159	36	15	problems	problem	NOUN
fcis-24159	36	16	that	that	PRON
fcis-24159	36	17	are	be	AUX
fcis-24159	36	18	less	less	ADJ
fcis-24159	36	19	in	in	ADP
fcis-24159	36	20	size	size	NOUN
fcis-24159	36	21	but	but	CCONJ
fcis-24159	36	22	identical	identical	ADJ
fcis-24159	36	23	to	to	ADP
fcis-24159	36	24	the	the	DET
fcis-24159	36	25	original	original	ADJ
fcis-24159	36	26	problem	problem	NOUN
fcis-24159	36	27	and	and	CCONJ
fcis-24159	36	28	solve	solve	VERB
fcis-24159	36	29	them	they	PRON
fcis-24159	36	30	separately[7	separately[7	VERB
fcis-24159	36	31	]	]	X
fcis-24159	36	32	.	.	PUNCT
fcis-24159	37	1	a	a	DET
fcis-24159	37	2	divide	divide	NOUN
fcis-24159	37	3	and	and	CCONJ
fcis-24159	37	4	conquer	conquer	VERB
fcis-24159	37	5	algorithm	algorithm	NOUN
fcis-24159	37	6	generally	generally	ADV
fcis-24159	37	7	includes	include	VERB
fcis-24159	37	8	the	the	DET
fcis-24159	37	9	following	follow	VERB
fcis-24159	37	10	three	three	NUM
fcis-24159	37	11	main	main	ADJ
fcis-24159	37	12	steps	step	NOUN
fcis-24159	37	13	:	:	PUNCT
fcis-24159	37	14	(	(	PUNCT
fcis-24159	37	15	1	1	X
fcis-24159	37	16	)	)	PUNCT
fcis-24159	37	17	divide	divide	VERB
fcis-24159	37	18	the	the	DET
fcis-24159	37	19	original	original	ADJ
fcis-24159	37	20	problem	problem	NOUN
fcis-24159	37	21	into	into	ADP
fcis-24159	37	22	several	several	ADJ
fcis-24159	37	23	smaller	small	ADJ
fcis-24159	37	24	,	,	PUNCT
fcis-24159	37	25	independent	independent	ADJ
fcis-24159	37	26	sub	sub	NOUN
fcis-24159	37	27	-	-	NOUN
fcis-24159	37	28	problems	problem	NOUN
fcis-24159	37	29	that	that	PRON
fcis-24159	37	30	are	be	AUX
fcis-24159	37	31	the	the	DET
fcis-24159	37	32	same	same	ADJ
fcis-24159	37	33	or	or	CCONJ
fcis-24159	37	34	similar	similar	ADJ
fcis-24159	37	35	in	in	ADP
fcis-24159	37	36	form	form	NOUN
fcis-24159	37	37	to	to	ADP
fcis-24159	37	38	the	the	DET
fcis-24159	37	39	original	original	ADJ
fcis-24159	37	40	problem[8	problem[8	NOUN
fcis-24159	37	41	]	]	X
fcis-24159	37	42	;	;	PUNCT
fcis-24159	37	43	(	(	PUNCT
fcis-24159	37	44	2	2	X
fcis-24159	37	45	)	)	PUNCT
fcis-24159	37	46	use	use	VERB
fcis-24159	37	47	recursion	recursion	NOUN
fcis-24159	37	48	to	to	PART
fcis-24159	37	49	find	find	VERB
fcis-24159	37	50	the	the	DET
fcis-24159	37	51	solutions	solution	NOUN
fcis-24159	37	52	to	to	ADP
fcis-24159	37	53	each	each	DET
fcis-24159	37	54	sub	sub	NOUN
fcis-24159	37	55	-	-	NOUN
fcis-24159	37	56	problem	problem	NOUN
fcis-24159	37	57	;	;	PUNCT
fcis-24159	37	58	(	(	PUNCT
fcis-24159	37	59	3	3	X
fcis-24159	37	60	)	)	PUNCT
fcis-24159	37	61	merge	merge	VERB
fcis-24159	37	62	the	the	DET
fcis-24159	37	63	sub	sub	NOUN
fcis-24159	37	64	-	-	NOUN
fcis-24159	37	65	problems	problem	NOUN
fcis-24159	37	66	'	'	PART
fcis-24159	37	67	solutions	solution	NOUN
fcis-24159	37	68	to	to	PART
fcis-24159	37	69	obtain	obtain	VERB
fcis-24159	37	70	the	the	DET
fcis-24159	37	71	original	original	ADJ
fcis-24159	37	72	problem	problem	NOUN
fcis-24159	37	73	's	's	PART
fcis-24159	37	74	solution	solution	NOUN
fcis-24159	37	75	.	.	PUNCT
fcis-24159	38	1	example	example	NOUN
fcis-24159	38	2	problem	problem	NOUN
fcis-24159	38	3	:	:	PUNCT
fcis-24159	38	4	like	like	ADJ
fcis-24159	38	5	-	-	PUNCT
fcis-24159	38	6	minded	minded	ADJ
fcis-24159	38	7	book	book	NOUN
fcis-24159	38	8	friends	friend	NOUN
fcis-24159	38	9	.	.	PUNCT
fcis-24159	39	1	recommendation	recommendation	NOUN
fcis-24159	39	2	websites	website	NOUN
fcis-24159	39	3	like	like	ADP
fcis-24159	39	4	douban	douban	NOUN
fcis-24159	39	5	will	will	AUX
fcis-24159	39	6	find	find	VERB
fcis-24159	39	7	readers	reader	NOUN
fcis-24159	39	8	in	in	ADP
fcis-24159	39	9	its	its	PRON
fcis-24159	39	10	database	database	NOUN
fcis-24159	39	11	with	with	ADP
fcis-24159	39	12	very	very	ADV
fcis-24159	39	13	similar	similar	ADJ
fcis-24159	39	14	ratings	rating	NOUN
fcis-24159	39	15	to	to	ADP
fcis-24159	39	16	yours	yours	PRON
fcis-24159	39	17	for	for	ADP
fcis-24159	39	18	a	a	DET
fcis-24159	39	19	series	series	NOUN
fcis-24159	39	20	of	of	ADP
fcis-24159	39	21	books	book	NOUN
fcis-24159	39	22	and	and	CCONJ
fcis-24159	39	23	recommend	recommend	VERB
fcis-24159	39	24	them	they	PRON
fcis-24159	39	25	to	to	ADP
fcis-24159	39	26	you	you	PRON
fcis-24159	39	27	,	,	PUNCT
fcis-24159	39	28	helping	help	VERB
fcis-24159	39	29	you	you	PRON
fcis-24159	39	30	find	find	VERB
fcis-24159	39	31	likeminded	likeminded	ADJ
fcis-24159	39	32	book	book	NOUN
fcis-24159	39	33	friends	friend	NOUN
fcis-24159	39	34	.	.	PUNCT
fcis-24159	40	1	suppose	suppose	VERB
fcis-24159	40	2	your	your	PRON
fcis-24159	40	3	ratings	rating	NOUN
fcis-24159	40	4	for	for	ADP
fcis-24159	40	5	five	five	NUM
fcis-24159	40	6	books	book	NOUN
fcis-24159	40	7	from	from	ADP
fcis-24159	40	8	low	low	ADJ
fcis-24159	40	9	to	to	ADP
fcis-24159	40	10	high	high	ADJ
fcis-24159	40	11	are	be	AUX
fcis-24159	40	12	[	[	X
fcis-24159	40	13	1,2,3,4,5	1,2,3,4,5	NUM
fcis-24159	40	14	]	]	PUNCT
fcis-24159	40	15	,	,	PUNCT
fcis-24159	40	16	and	and	CCONJ
fcis-24159	40	17	reader	reader	VERB
fcis-24159	40	18	a	a	PRON
fcis-24159	40	19	's	's	PART
fcis-24159	40	20	ratings	rating	NOUN
fcis-24159	40	21	for	for	ADP
fcis-24159	40	22	these	these	DET
fcis-24159	40	23	five	five	NUM
fcis-24159	40	24	books	book	NOUN
fcis-24159	40	25	are	be	AUX
fcis-24159	40	26	[	[	X
fcis-24159	40	27	2,4,1,3,5	2,4,1,3,5	X
fcis-24159	40	28	]	]	PUNCT
fcis-24159	40	29	,	,	PUNCT
fcis-24159	40	30	and	and	CCONJ
fcis-24159	40	31	reader	reader	PROPN
fcis-24159	40	32	b	b	PROPN
fcis-24159	40	33	's	's	PART
fcis-24159	40	34	ratings	rating	NOUN
fcis-24159	40	35	are	be	AUX
fcis-24159	40	36	[	[	X
fcis-24159	40	37	3,4,1,5,2	3,4,1,5,2	NUM
fcis-24159	40	38	]	]	PUNCT
fcis-24159	40	39	,	,	PUNCT
fcis-24159	40	40	then	then	ADV
fcis-24159	40	41	douban	douban	PROPN
fcis-24159	40	42	might	might	AUX
fcis-24159	40	43	recommend	recommend	VERB
fcis-24159	40	44	reader	reader	NOUN
fcis-24159	40	45	a	a	PRON
fcis-24159	40	46	to	to	ADP
fcis-24159	40	47	you	you	PRON
fcis-24159	40	48	.	.	PUNCT
fcis-24159	41	1	the	the	DET
fcis-24159	41	2	recommendation	recommendation	NOUN
fcis-24159	41	3	criterion	criterion	NOUN
fcis-24159	41	4	is	be	AUX
fcis-24159	41	5	to	to	PART
fcis-24159	41	6	measure	measure	VERB
fcis-24159	41	7	similarity	similarity	NOUN
fcis-24159	41	8	by	by	ADP
fcis-24159	41	9	calculating	calculate	VERB
fcis-24159	41	10	the	the	DET
fcis-24159	41	11	inverse	inverse	NOUN
fcis-24159	41	12	order	order	NOUN
fcis-24159	41	13	quantity	quantity	NOUN
fcis-24159	41	14	.	.	PUNCT
fcis-24159	42	1	for	for	ADP
fcis-24159	42	2	example	example	NOUN
fcis-24159	42	3	,	,	PUNCT
fcis-24159	42	4	the	the	DET
fcis-24159	42	5	inverse	inverse	NOUN
fcis-24159	42	6	order	order	NOUN
fcis-24159	42	7	count	count	VERB
fcis-24159	42	8	for	for	ADP
fcis-24159	42	9	[	[	X
fcis-24159	42	10	1,2,3,4,5	1,2,3,4,5	NUM
fcis-24159	42	11	]	]	PUNCT
fcis-24159	42	12	is	be	AUX
fcis-24159	42	13	0	0	NUM
fcis-24159	42	14	,	,	PUNCT
fcis-24159	42	15	for	for	ADP
fcis-24159	42	16	[	[	X
fcis-24159	42	17	2,4,1,3,5	2,4,1,3,5	NUM
fcis-24159	42	18	]	]	X
fcis-24159	42	19	it	it	PRON
fcis-24159	42	20	is	be	AUX
fcis-24159	42	21	3	3	NUM
fcis-24159	42	22	,	,	PUNCT
fcis-24159	42	23	and	and	CCONJ
fcis-24159	42	24	for	for	ADP
fcis-24159	42	25	[	[	X
fcis-24159	42	26	3,4,1,5,2	3,4,1,5,2	X
fcis-24159	42	27	]	]	X
fcis-24159	42	28	it	it	PRON
fcis-24159	42	29	is	be	AUX
fcis-24159	42	30	5	5	NUM
fcis-24159	42	31	,	,	PUNCT
fcis-24159	42	32	which	which	PRON
fcis-24159	42	33	means	mean	VERB
fcis-24159	42	34	compared	compare	VERB
fcis-24159	42	35	to	to	ADP
fcis-24159	42	36	reader	reader	PROPN
fcis-24159	42	37	b	b	PROPN
fcis-24159	42	38	,	,	PUNCT
fcis-24159	42	39	reader	reader	NOUN
fcis-24159	42	40	a	a	PRON
fcis-24159	42	41	's	's	PART
fcis-24159	42	42	taste	taste	NOUN
fcis-24159	42	43	is	be	AUX
fcis-24159	42	44	closer	close	ADJ
fcis-24159	42	45	to	to	ADP
fcis-24159	42	46	yours	yours	PRON
fcis-24159	42	47	.	.	PUNCT
fcis-24159	43	1	solve	solve	VERB
fcis-24159	43	2	the	the	DET
fcis-24159	43	3	inverse	inverse	NOUN
fcis-24159	43	4	order	order	NOUN
fcis-24159	43	5	problem	problem	NOUN
fcis-24159	43	6	programmatically	programmatically	ADV
fcis-24159	43	7	.	.	PUNCT
fcis-24159	44	1	for	for	ADP
fcis-24159	44	2	example	example	NOUN
fcis-24159	44	3	,	,	PUNCT
fcis-24159	44	4	the	the	DET
fcis-24159	44	5	input	input	NOUN
fcis-24159	44	6	sequence	sequence	NOUN
fcis-24159	44	7	is	be	AUX
fcis-24159	44	8	[	[	X
fcis-24159	44	9	5,9,3,8,6,7,10	5,9,3,8,6,7,10	NUM
fcis-24159	44	10	]	]	PUNCT
fcis-24159	44	11	.	.	PUNCT
fcis-24159	45	1	problem	problem	NOUN
fcis-24159	45	2	analysis	analysis	NOUN
fcis-24159	45	3	:	:	PUNCT
fcis-24159	45	4	for	for	ADP
fcis-24159	45	5	an	an	DET
fcis-24159	45	6	array	array	NOUN
fcis-24159	45	7	a	a	X
fcis-24159	45	8	,	,	PUNCT
fcis-24159	45	9	let	let	VERB
fcis-24159	45	10	la	la	X
fcis-24159	45	11	be	be	AUX
fcis-24159	45	12	the	the	DET
fcis-24159	45	13	left	left	ADJ
fcis-24159	45	14	half	half	NOUN
fcis-24159	45	15	,	,	PUNCT
fcis-24159	45	16	and	and	CCONJ
fcis-24159	45	17	ra	ra	PROPN
fcis-24159	45	18	be	be	AUX
fcis-24159	45	19	the	the	DET
fcis-24159	45	20	right	right	ADJ
fcis-24159	45	21	half	half	NOUN
fcis-24159	45	22	divided	divide	VERB
fcis-24159	45	23	by	by	ADP
fcis-24159	45	24	the	the	DET
fcis-24159	45	25	midpoint	midpoint	NOUN
fcis-24159	45	26	.	.	PUNCT
fcis-24159	46	1	let	let	AUX
fcis-24159	46	2	n(a	n(a	NOUN
fcis-24159	46	3	)	)	PUNCT
fcis-24159	46	4	be	be	VERB
fcis-24159	46	5	the	the	DET
fcis-24159	46	6	inverse	inverse	ADJ
fcis-24159	46	7	order	order	NOUN
fcis-24159	46	8	count	count	NOUN
fcis-24159	46	9	of	of	ADP
fcis-24159	46	10	a	a	PRON
fcis-24159	46	11	,	,	PUNCT
fcis-24159	46	12	and	and	CCONJ
fcis-24159	46	13	f(x	f(x	PROPN
fcis-24159	46	14	)	)	PUNCT
fcis-24159	46	15	be	be	VERB
fcis-24159	46	16	the	the	DET
fcis-24159	46	17	number	number	NOUN
fcis-24159	46	18	of	of	ADP
fcis-24159	46	19	ra	ra	PROPN
fcis-24159	46	20	elements	element	NOUN
fcis-24159	46	21	greater	great	ADJ
fcis-24159	46	22	than	than	ADP
fcis-24159	46	23	the	the	DET
fcis-24159	46	24	number	number	NOUN
fcis-24159	46	25	x	x	PUNCT
fcis-24159	46	26	in	in	ADP
fcis-24159	46	27	la	la	PROPN
fcis-24159	46	28	.	.	PUNCT
fcis-24159	47	1	then	then	ADV
fcis-24159	47	2	,	,	PUNCT
fcis-24159	47	3	we	we	PRON
fcis-24159	47	4	derive	derive	VERB
fcis-24159	47	5	the	the	DET
fcis-24159	47	6	formula	formula	NOUN
fcis-24159	47	7	:	:	PUNCT
fcis-24159	47	8	according	accord	VERB
fcis-24159	47	9	to	to	ADP
fcis-24159	47	10	the	the	DET
fcis-24159	47	11	divide	divide	NOUN
fcis-24159	47	12	and	and	CCONJ
fcis-24159	47	13	conquer	conquer	VERB
fcis-24159	47	14	strategy	strategy	NOUN
fcis-24159	47	15	,	,	PUNCT
fcis-24159	47	16	we	we	PRON
fcis-24159	47	17	continue	continue	VERB
fcis-24159	47	18	to	to	PART
fcis-24159	47	19	break	break	VERB
fcis-24159	47	20	down	down	ADP
fcis-24159	47	21	,	,	PUNCT
fcis-24159	47	22	and	and	CCONJ
fcis-24159	47	23	when	when	SCONJ
fcis-24159	47	24	the	the	DET
fcis-24159	47	25	number	number	NOUN
fcis-24159	47	26	of	of	ADP
fcis-24159	47	27	elements	element	NOUN
fcis-24159	47	28	in	in	ADP
fcis-24159	47	29	a	a	PRON
fcis-24159	47	30	is	be	AUX
fcis-24159	47	31	1	1	NUM
fcis-24159	47	32	,	,	PUNCT
fcis-24159	47	33	its	its	PRON
fcis-24159	47	34	n(a	n(a	NOUN
fcis-24159	47	35	)	)	PUNCT
fcis-24159	47	36	is	be	AUX
fcis-24159	47	37	0	0	NUM
fcis-24159	47	38	.	.	PUNCT
fcis-24159	48	1	therefore	therefore	ADV
fcis-24159	48	2	,	,	PUNCT
fcis-24159	48	3	what	what	PRON
fcis-24159	48	4	we	we	PRON
fcis-24159	48	5	need	need	VERB
fcis-24159	48	6	to	to	PART
fcis-24159	48	7	solve	solve	VERB
fcis-24159	48	8	additionally	additionally	ADV
fcis-24159	48	9	is	be	AUX
fcis-24159	48	10	∑	∑	PUNCT
fcis-24159	48	11	first	first	ADJ
fcis-24159	48	12	,	,	PUNCT
fcis-24159	48	13	we	we	PRON
fcis-24159	48	14	think	think	VERB
fcis-24159	48	15	of	of	ADP
fcis-24159	48	16	a	a	DET
fcis-24159	48	17	naive	naive	ADJ
fcis-24159	48	18	algorithm	algorithm	NOUN
fcis-24159	48	19	to	to	PART
fcis-24159	48	20	traverse	traverse	VERB
fcis-24159	48	21	all	all	DET
fcis-24159	48	22	elements	element	NOUN
fcis-24159	48	23	in	in	ADP
fcis-24159	48	24	la	la	ADV
fcis-24159	48	25	and	and	CCONJ
fcis-24159	48	26	ra	ra	PROPN
fcis-24159	48	27	one	one	NUM
fcis-24159	48	28	by	by	ADP
fcis-24159	48	29	one	one	NUM
fcis-24159	48	30	,	,	PUNCT
fcis-24159	48	31	but	but	CCONJ
fcis-24159	48	32	the	the	DET
fcis-24159	48	33	time	time	NOUN
fcis-24159	48	34	complexity	complexity	NOUN
fcis-24159	48	35	of	of	ADP
fcis-24159	48	36	this	this	PRON
fcis-24159	48	37	is	be	AUX
fcis-24159	48	38	o(n^2	o(n^2	PROPN
fcis-24159	48	39	)	)	PUNCT
fcis-24159	48	40	,	,	PUNCT
fcis-24159	48	41	which	which	PRON
fcis-24159	48	42	is	be	AUX
fcis-24159	48	43	no	no	ADV
fcis-24159	48	44	different	different	ADJ
fcis-24159	48	45	from	from	ADP
fcis-24159	48	46	direct	direct	ADJ
fcis-24159	48	47	brute	brute	ADJ
fcis-24159	48	48	force	force	PROPN
fcis-24159	48	49	enumeration	enumeration	NOUN
fcis-24159	48	50	,	,	PUNCT
fcis-24159	48	51	so	so	ADV
fcis-24159	48	52	we	we	PRON
fcis-24159	48	53	try	try	VERB
fcis-24159	48	54	to	to	PART
fcis-24159	48	55	optimize	optimize	VERB
fcis-24159	48	56	the	the	DET
fcis-24159	48	57	algorithm	algorithm	NOUN
fcis-24159	48	58	;	;	PUNCT
fcis-24159	48	59	since	since	SCONJ
fcis-24159	48	60	the	the	DET
fcis-24159	48	61	order	order	NOUN
fcis-24159	48	62	of	of	ADP
fcis-24159	48	63	elements	element	NOUN
fcis-24159	48	64	inside	inside	ADP
fcis-24159	48	65	la	la	ADV
fcis-24159	48	66	and	and	CCONJ
fcis-24159	48	67	na	na	AUX
fcis-24159	48	68	has	have	VERB
fcis-24159	48	69	no	no	DET
fcis-24159	48	70	effect	effect	NOUN
fcis-24159	48	71	on	on	ADP
fcis-24159	48	72	∑	∑	PUNCT
fcis-24159	48	73	,	,	PUNCT
fcis-24159	48	74	we	we	PRON
fcis-24159	48	75	can	can	AUX
fcis-24159	48	76	sort	sort	VERB
fcis-24159	48	77	ra	ra	PROPN
fcis-24159	48	78	in	in	ADP
fcis-24159	48	79	non	non	ADJ
fcis-24159	48	80	-	-	ADJ
fcis-24159	48	81	decreasing	decrease	VERB
fcis-24159	48	82	order	order	NOUN
fcis-24159	48	83	when	when	SCONJ
fcis-24159	48	84	calculating	calculate	VERB
fcis-24159	48	85	n(ra	n(ra	PROPN
fcis-24159	48	86	)	)	PUNCT
fcis-24159	48	87	,	,	PUNCT
fcis-24159	48	88	and	and	CCONJ
fcis-24159	48	89	use	use	VERB
fcis-24159	48	90	binary	binary	ADJ
fcis-24159	48	91	search	search	NOUN
fcis-24159	48	92	to	to	PART
fcis-24159	48	93	find	find	VERB
fcis-24159	48	94	f(la[i	f(la[i	PROPN
fcis-24159	48	95	]	]	X
fcis-24159	48	96	)	)	PUNCT
fcis-24159	48	97	,	,	PUNCT
fcis-24159	48	98	at	at	ADP
fcis-24159	48	99	this	this	DET
fcis-24159	48	100	time	time	NOUN
fcis-24159	48	101	,	,	PUNCT
fcis-24159	48	102	the	the	DET
fcis-24159	48	103	time	time	NOUN
fcis-24159	48	104	complexity	complexity	NOUN
fcis-24159	48	105	is	be	AUX
fcis-24159	48	106	o(n	o(n	PROPN
fcis-24159	48	107	log	log	NOUN
fcis-24159	48	108	)	)	PUNCT
fcis-24159	48	109	;	;	PUNCT
fcis-24159	48	110	when	when	SCONJ
fcis-24159	48	111	calculating	calculate	VERB
fcis-24159	48	112	la	la	NOUN
fcis-24159	48	113	,	,	PUNCT
fcis-24159	48	114	also	also	ADV
fcis-24159	48	115	sort	sort	VERB
fcis-24159	48	116	it	it	PRON
fcis-24159	48	117	in	in	ADP
fcis-24159	48	118	non	non	ADJ
fcis-24159	48	119	-	-	ADJ
fcis-24159	48	120	decreasing	decrease	VERB
fcis-24159	48	121	order	order	NOUN
fcis-24159	48	122	and	and	CCONJ
fcis-24159	48	123	enumerate	enumerate	VERB
fcis-24159	48	124	the	the	DET
fcis-24159	48	125	xth	xth	PROPN
fcis-24159	48	126	element	element	NOUN
fcis-24159	48	127	in	in	ADP
fcis-24159	48	128	la	la	PROPN
fcis-24159	48	129	.	.	PROPN
fcis-24159	48	130	1	1	NUM
fcis-24159	48	131	according	accord	VERB
fcis-24159	48	132	to	to	ADP
fcis-24159	48	133	the	the	DET
fcis-24159	48	134	above	above	ADJ
fcis-24159	48	135	conclusion	conclusion	NOUN
fcis-24159	48	136	,	,	PUNCT
fcis-24159	48	137	we	we	PRON
fcis-24159	48	138	only	only	ADV
fcis-24159	48	139	need	need	VERB
fcis-24159	48	140	to	to	PART
fcis-24159	48	141	define	define	VERB
fcis-24159	48	142	a	a	DET
fcis-24159	48	143	variable	variable	ADJ
fcis-24159	48	144	temp	temp	NOUN
fcis-24159	48	145	to	to	PART
fcis-24159	48	146	record	record	VERB
fcis-24159	48	147	the	the	DET
fcis-24159	48	148	number	number	NOUN
fcis-24159	48	149	of	of	ADP
fcis-24159	48	150	elements	element	NOUN
fcis-24159	48	151	in	in	ADP
fcis-24159	48	152	la	la	PROPN
fcis-24159	48	153	that	that	PRON
fcis-24159	48	154	are	be	AUX
fcis-24159	48	155	greater	great	ADJ
fcis-24159	48	156	than	than	ADP
fcis-24159	48	157	the	the	DET
fcis-24159	48	158	elements	element	NOUN
fcis-24159	48	159	in	in	ADP
fcis-24159	48	160	ra	ra	PROPN
fcis-24159	48	161	,	,	PUNCT
fcis-24159	48	162	set	set	VERB
fcis-24159	48	163	ans	an	NOUN
fcis-24159	48	164	to	to	PART
fcis-24159	48	165	record	record	VERB
fcis-24159	48	166	the	the	DET
fcis-24159	48	167	current	current	ADJ
fcis-24159	48	168	sum	sum	NOUN
fcis-24159	48	169	of	of	ADP
fcis-24159	48	170	f(la[i	f(la[i	PROPN
fcis-24159	48	171	]	]	PUNCT
fcis-24159	48	172	)	)	PUNCT
fcis-24159	48	173	,	,	PUNCT
fcis-24159	48	174	and	and	CCONJ
fcis-24159	48	175	each	each	DET
fcis-24159	48	176	time	time	NOUN
fcis-24159	48	177	a	a	DET
fcis-24159	48	178	new	new	ADJ
fcis-24159	48	179	element	element	NOUN
fcis-24159	48	180	of	of	ADP
fcis-24159	48	181	la	la	PROPN
fcis-24159	48	182	is	be	AUX
fcis-24159	48	183	enumerated	enumerate	VERB
fcis-24159	48	184	,	,	PUNCT
fcis-24159	48	185	only	only	ADV
fcis-24159	48	186	the	the	DET
fcis-24159	48	187	following	follow	VERB
fcis-24159	48	188	judgment	judgment	NOUN
fcis-24159	48	189	is	be	AUX
fcis-24159	48	190	needed	need	VERB
fcis-24159	48	191	:	:	PUNCT
fcis-24159	48	192	1	1	NUM
fcis-24159	48	193	the	the	DET
fcis-24159	48	194	time	time	NOUN
fcis-24159	48	195	complexity	complexity	NOUN
fcis-24159	48	196	of	of	ADP
fcis-24159	48	197	the	the	DET
fcis-24159	48	198	algorithm	algorithm	NOUN
fcis-24159	48	199	is	be	AUX
fcis-24159	48	200	o(nlog	o(nlog	NOUN
fcis-24159	48	201	)	)	PUNCT
fcis-24159	48	202	.	.	PUNCT
fcis-24159	49	1	the	the	DET
fcis-24159	49	2	program	program	NOUN
fcis-24159	49	3	and	and	CCONJ
fcis-24159	49	4	the	the	DET
fcis-24159	49	5	running	running	NOUN
fcis-24159	49	6	result	result	NOUN
fcis-24159	49	7	are	be	AUX
fcis-24159	49	8	shown	show	VERB
fcis-24159	49	9	in	in	ADP
fcis-24159	49	10	figure	figure	NOUN
fcis-24159	49	11	2	2	NUM
fcis-24159	49	12	.	.	PUNCT
fcis-24159	49	13	considerations	consideration	NOUN
fcis-24159	49	14	for	for	ADP
fcis-24159	49	15	using	use	VERB
fcis-24159	49	16	divide	divide	NOUN
fcis-24159	49	17	and	and	CCONJ
fcis-24159	49	18	conquer	conquer	VERB
fcis-24159	49	19	algorithms	algorithm	NOUN
fcis-24159	49	20	:	:	PUNCT
fcis-24159	49	21	(	(	PUNCT
fcis-24159	49	22	1	1	X
fcis-24159	49	23	)	)	PUNCT
fcis-24159	49	24	divide	divide	NOUN
fcis-24159	49	25	and	and	CCONJ
fcis-24159	49	26	conquer	conquer	VERB
fcis-24159	49	27	algorithms	algorithm	NOUN
fcis-24159	49	28	typically	typically	ADV
fcis-24159	49	29	rely	rely	VERB
fcis-24159	49	30	on	on	ADP
fcis-24159	49	31	recursive	recursive	ADJ
fcis-24159	49	32	algorithms	algorithm	NOUN
fcis-24159	49	33	,	,	PUNCT
fcis-24159	49	34	so	so	CCONJ
fcis-24159	49	35	when	when	SCONJ
fcis-24159	49	36	using	use	VERB
fcis-24159	49	37	divide	divide	NOUN
fcis-24159	49	38	and	and	CCONJ
fcis-24159	49	39	conquer	conquer	VERB
fcis-24159	49	40	algorithms	algorithm	NOUN
fcis-24159	49	41	,	,	PUNCT
fcis-24159	49	42	the	the	DET
fcis-24159	49	43	problem	problem	NOUN
fcis-24159	49	44	must	must	AUX
fcis-24159	49	45	also	also	ADV
fcis-24159	49	46	meet	meet	VERB
fcis-24159	49	47	the	the	DET
fcis-24159	49	48	requirements	requirement	NOUN
fcis-24159	49	49	for	for	ADP
fcis-24159	49	50	using	use	VERB
fcis-24159	49	51	recursive	recursive	ADJ
fcis-24159	49	52	algorithms	algorithm	NOUN
fcis-24159	49	53	.	.	PUNCT
fcis-24159	50	1	(	(	PUNCT
fcis-24159	50	2	2	2	X
fcis-24159	50	3	)	)	PUNCT
fcis-24159	50	4	reasonably	reasonably	ADV
fcis-24159	50	5	dividing	divide	VERB
fcis-24159	50	6	the	the	DET
fcis-24159	50	7	original	original	ADJ
fcis-24159	50	8	problem	problem	NOUN
fcis-24159	50	9	into	into	ADP
fcis-24159	50	10	several	several	ADJ
fcis-24159	50	11	sub	sub	NOUN
fcis-24159	50	12	-	-	NOUN
fcis-24159	50	13	problems	problem	NOUN
fcis-24159	50	14	and	and	CCONJ
fcis-24159	50	15	being	be	AUX
fcis-24159	50	16	able	able	ADJ
fcis-24159	50	17	to	to	PART
fcis-24159	50	18	solve	solve	VERB
fcis-24159	50	19	them	they	PRON
fcis-24159	50	20	correctly	correctly	ADV
fcis-24159	50	21	is	be	AUX
fcis-24159	50	22	the	the	DET
fcis-24159	50	23	key	key	NOUN
fcis-24159	50	24	and	and	CCONJ
fcis-24159	50	25	difficulty	difficulty	NOUN
fcis-24159	50	26	of	of	ADP
fcis-24159	50	27	divide	divide	NOUN
fcis-24159	50	28	and	and	CCONJ
fcis-24159	50	29	conquer	conquer	VERB
fcis-24159	50	30	algorithms	algorithm	NOUN
fcis-24159	50	31	.	.	PUNCT
fcis-24159	51	1	therefore	therefore	ADV
fcis-24159	51	2	,	,	PUNCT
fcis-24159	51	3	we	we	PRON
fcis-24159	51	4	must	must	AUX
fcis-24159	51	5	focus	focus	VERB
fcis-24159	51	6	on	on	ADP
fcis-24159	51	7	how	how	SCONJ
fcis-24159	51	8	to	to	PART
fcis-24159	51	9	divide	divide	VERB
fcis-24159	51	10	and	and	CCONJ
fcis-24159	51	11	"	"	PUNCT
fcis-24159	51	12	conquer	conquer	NOUN
fcis-24159	51	13	"	"	PUNCT
fcis-24159	51	14	after	after	ADP
fcis-24159	51	15	the	the	DET
fcis-24159	51	16	division	division	NOUN
fcis-24159	51	17	[	[	X
fcis-24159	51	18	9	9	NUM
fcis-24159	51	19	]	]	PUNCT
fcis-24159	51	20	.	.	PUNCT
fcis-24159	52	1	4	4	X
fcis-24159	52	2	.	.	X
fcis-24159	52	3	conclusion	conclusion	NOUN
fcis-24159	52	4	recursion	recursion	NOUN
fcis-24159	52	5	is	be	AUX
fcis-24159	52	6	a	a	DET
fcis-24159	52	7	powerful	powerful	ADJ
fcis-24159	52	8	tool	tool	NOUN
fcis-24159	52	9	for	for	ADP
fcis-24159	52	10	designing	design	VERB
fcis-24159	52	11	and	and	CCONJ
fcis-24159	52	12	describing	describe	VERB
fcis-24159	52	13	algorithms	algorithm	NOUN
fcis-24159	52	14	and	and	CCONJ
fcis-24159	52	15	is	be	AUX
fcis-24159	52	16	often	often	ADV
fcis-24159	52	17	used	use	VERB
fcis-24159	52	18	to	to	PART
fcis-24159	52	19	describe	describe	VERB
fcis-24159	52	20	complex	complex	ADJ
fcis-24159	52	21	algorithms	algorithm	NOUN
fcis-24159	52	22	.	.	PUNCT
fcis-24159	53	1	although	although	SCONJ
fcis-24159	53	2	recursion	recursion	NOUN
fcis-24159	53	3	is	be	AUX
fcis-24159	53	4	used	use	VERB
fcis-24159	53	5	in	in	ADP
fcis-24159	53	6	the	the	DET
fcis-24159	53	7	implementation	implementation	NOUN
fcis-24159	53	8	of	of	ADP
fcis-24159	53	9	many	many	ADJ
fcis-24159	53	10	complex	complex	ADJ
fcis-24159	53	11	algorithms	algorithm	NOUN
fcis-24159	53	12	and	and	CCONJ
fcis-24159	53	13	is	be	AUX
fcis-24159	53	14	one	one	NUM
fcis-24159	53	15	of	of	ADP
fcis-24159	53	16	the	the	DET
fcis-24159	53	17	foundations	foundation	NOUN
fcis-24159	53	18	of	of	ADP
fcis-24159	53	19	learning	learn	VERB
fcis-24159	53	20	algorithm	algorithm	NOUN
fcis-24159	53	21	design	design	NOUN
fcis-24159	53	22	,	,	PUNCT
fcis-24159	53	23	recursive	recursive	ADJ
fcis-24159	53	24	algorithms	algorithm	NOUN
fcis-24159	53	25	are	be	AUX
fcis-24159	53	26	abstract	abstract	ADJ
fcis-24159	53	27	and	and	CCONJ
fcis-24159	53	28	complex	complex	ADJ
fcis-24159	53	29	for	for	SCONJ
fcis-24159	53	30	beginners	beginner	NOUN
fcis-24159	53	31	to	to	PART
fcis-24159	53	32	understand	understand	VERB
fcis-24159	53	33	,	,	PUNCT
fcis-24159	53	34	making	make	VERB
fcis-24159	53	35	it	it	PRON
fcis-24159	53	36	one	one	NUM
fcis-24159	53	37	of	of	ADP
fcis-24159	53	38	the	the	DET
fcis-24159	53	39	focal	focal	ADJ
fcis-24159	53	40	points	point	NOUN
fcis-24159	53	41	in	in	ADP
fcis-24159	53	42	the	the	DET
fcis-24159	53	43	curriculum	curriculum	NOUN
fcis-24159	53	44	of	of	ADP
fcis-24159	53	45	algorithm	algorithm	NOUN
fcis-24159	53	46	design	design	NOUN
fcis-24159	53	47	and	and	CCONJ
fcis-24159	53	48	analysis	analysis	NOUN
fcis-24159	53	49	.	.	PUNCT
fcis-24159	54	1	divide	divide	VERB
fcis-24159	54	2	and	and	CCONJ
fcis-24159	54	3	conquer	conquer	VERB
fcis-24159	54	4	algorithms	algorithm	NOUN
fcis-24159	54	5	have	have	VERB
fcis-24159	54	6	a	a	DET
fcis-24159	54	7	wide	wide	ADJ
fcis-24159	54	8	range	range	NOUN
fcis-24159	54	9	of	of	ADP
fcis-24159	54	10	practical	practical	ADJ
fcis-24159	54	11	applications	application	NOUN
fcis-24159	54	12	.	.	PUNCT
fcis-24159	55	1	teaching	teach	VERB
fcis-24159	55	2	students	student	NOUN
fcis-24159	55	3	about	about	ADP
fcis-24159	55	4	divide	divide	NOUN
fcis-24159	55	5	and	and	CCONJ
fcis-24159	55	6	conquer	conquer	VERB
fcis-24159	55	7	algorithms	algorithms	NOUN
fcis-24159	55	8	is	be	AUX
fcis-24159	55	9	also	also	ADV
fcis-24159	55	10	necessary	necessary	ADJ
fcis-24159	55	11	to	to	PART
fcis-24159	55	12	cultivate	cultivate	VERB
fcis-24159	55	13	their	their	PRON
fcis-24159	55	14	ability	ability	NOUN
fcis-24159	55	15	to	to	PART
fcis-24159	55	16	transform	transform	VERB
fcis-24159	55	17	real	real	ADJ
fcis-24159	55	18	-	-	PUNCT
fcis-24159	55	19	world	world	NOUN
fcis-24159	55	20	problems	problem	NOUN
fcis-24159	55	21	into	into	ADP
fcis-24159	55	22	abstract	abstract	ADJ
fcis-24159	55	23	models	model	NOUN
fcis-24159	55	24	.	.	PUNCT
fcis-24159	56	1	this	this	DET
fcis-24159	56	2	article	article	NOUN
fcis-24159	56	3	uses	use	VERB
fcis-24159	56	4	python	python	NOUN
fcis-24159	56	5	as	as	ADP
fcis-24159	56	6	the	the	DET
fcis-24159	56	7	programming	programming	NOUN
fcis-24159	56	8	language	language	NOUN
fcis-24159	56	9	to	to	PART
fcis-24159	56	10	explain	explain	VERB
fcis-24159	56	11	the	the	DET
fcis-24159	56	12	above	above	ADJ
fcis-24159	56	13	two	two	NUM
fcis-24159	56	14	types	type	NOUN
fcis-24159	56	15	of	of	ADP
fcis-24159	56	16	algorithms	algorithm	NOUN
fcis-24159	56	17	,	,	PUNCT
fcis-24159	56	18	with	with	ADP
fcis-24159	56	19	classic	classic	ADJ
fcis-24159	56	20	examples	example	NOUN
fcis-24159	56	21	and	and	CCONJ
fcis-24159	56	22	specific	specific	ADJ
fcis-24159	56	23	analysis	analysis	NOUN
fcis-24159	56	24	,	,	PUNCT
fcis-24159	56	25	which	which	PRON
fcis-24159	56	26	has	have	VERB
fcis-24159	56	27	a	a	DET
fcis-24159	56	28	particular	particular	ADJ
fcis-24159	56	29	practical	practical	ADJ
fcis-24159	56	30	value	value	NOUN
fcis-24159	56	31	.	.	PUNCT
fcis-24159	57	1	55	55	NUM
fcis-24159	57	2	figure	figure	NOUN
fcis-24159	57	3	2	2	NUM
fcis-24159	57	4	.	.	PUNCT
fcis-24159	57	5	inversion	inversion	NOUN
fcis-24159	57	6	pairs	pair	NOUN
fcis-24159	57	7	acknowledgments	acknowledgment	NOUN
fcis-24159	57	8	this	this	DET
fcis-24159	57	9	work	work	NOUN
fcis-24159	57	10	was	be	AUX
fcis-24159	57	11	supported	support	VERB
fcis-24159	57	12	by	by	ADP
fcis-24159	57	13	the	the	DET
fcis-24159	57	14	guangdong	guangdong	PROPN
fcis-24159	57	15	ocean	ocean	PROPN
fcis-24159	57	16	university	university	PROPN
fcis-24159	57	17	research	research	PROPN
fcis-24159	57	18	startup	startup	PROPN
fcis-24159	57	19	foundation	foundation	PROPN
fcis-24159	57	20	(	(	PUNCT
fcis-24159	57	21	060302102304	060302102304	NUM
fcis-24159	57	22	)	)	PUNCT
fcis-24159	57	23	and	and	CCONJ
fcis-24159	57	24	the	the	DET
fcis-24159	57	25	guangdong	guangdong	PROPN
fcis-24159	57	26	ocean	ocean	PROPN
fcis-24159	57	27	university	university	PROPN
fcis-24159	57	28	innovation	innovation	NOUN
fcis-24159	57	29	and	and	CCONJ
fcis-24159	57	30	entrepreneurship	entrepreneurship	NOUN
fcis-24159	57	31	training	training	NOUN
fcis-24159	57	32	program	program	NOUN
fcis-24159	57	33	project	project	NOUN
fcis-24159	57	34	grant	grant	NOUN
fcis-24159	57	35	(	(	PUNCT
fcis-24159	57	36	cxxl	cxxl	NOUN
fcis-24159	57	37	2024132	2024132	NUM
fcis-24159	57	38	and	and	CCONJ
fcis-24159	57	39	cxxl2024141	cxxl2024141	PROPN
fcis-24159	57	40	)	)	PUNCT
fcis-24159	57	41	.	.	PUNCT
fcis-24159	58	1	references	reference	NOUN
fcis-24159	58	2	[	[	X
fcis-24159	58	3	1	1	X
fcis-24159	58	4	]	]	PUNCT
fcis-24159	58	5	na	na	PART
fcis-24159	58	6	jiaofen	jiaofen	PROPN
fcis-24159	58	7	,	,	PUNCT
fcis-24159	58	8	yang	yang	PROPN
fcis-24159	58	9	wenya	wenya	PROPN
fcis-24159	58	10	,	,	PUNCT
fcis-24159	58	11	li	li	PROPN
fcis-24159	58	12	hongchan	hongchan	PROPN
fcis-24159	58	13	,	,	PUNCT
fcis-24159	58	14	zhu	zhu	PROPN
fcis-24159	58	15	haodong	haodong	PROPN
fcis-24159	58	16	.	.	PUNCT
fcis-24159	59	1	reflections	reflection	NOUN
fcis-24159	59	2	on	on	ADP
fcis-24159	59	3	the	the	DET
fcis-24159	59	4	teaching	teaching	NOUN
fcis-24159	59	5	process	process	NOUN
fcis-24159	59	6	of	of	ADP
fcis-24159	59	7	"	"	PUNCT
fcis-24159	59	8	algorithm	algorithm	NOUN
fcis-24159	59	9	design	design	NOUN
fcis-24159	59	10	and	and	CCONJ
fcis-24159	59	11	analysis	analysis	NOUN
fcis-24159	59	12	"	"	PUNCT
fcis-24159	60	1	[	[	X
fcis-24159	60	2	j	j	X
fcis-24159	60	3	]	]	X
fcis-24159	60	4	.	.	PUNCT
fcis-24159	61	1	modern	modern	ADJ
fcis-24159	61	2	education	education	NOUN
fcis-24159	61	3	,	,	PUNCT
fcis-24159	61	4	2019	2019	NUM
fcis-24159	61	5	,	,	PUNCT
fcis-24159	61	6	6(35	6(35	NUM
fcis-24159	61	7	):	):	PUNCT
fcis-24159	61	8	189	189	NUM
fcis-24159	61	9	-	-	SYM
fcis-24159	61	10	190	190	NUM
fcis-24159	61	11	.	.	PUNCT
fcis-24159	62	1	[	[	X
fcis-24159	62	2	2	2	NUM
fcis-24159	62	3	]	]	PUNCT
fcis-24159	62	4	xu	xu	PROPN
fcis-24159	62	5	anxi	anxi	PROPN
fcis-24159	62	6	.	.	PUNCT
fcis-24159	63	1	a	a	DET
fcis-24159	63	2	brief	brief	ADJ
fcis-24159	63	3	discussion	discussion	NOUN
fcis-24159	63	4	on	on	ADP
fcis-24159	63	5	teaching	teaching	NOUN
fcis-24159	63	6	strategies	strategy	NOUN
fcis-24159	63	7	of	of	ADP
fcis-24159	63	8	recursive	recursive	ADJ
fcis-24159	63	9	algorithms	algorithm	NOUN
fcis-24159	63	10	[	[	X
fcis-24159	63	11	j	j	X
fcis-24159	63	12	]	]	X
fcis-24159	63	13	.	.	PUNCT
fcis-24159	64	1	china	china	PROPN
fcis-24159	64	2	new	new	ADJ
fcis-24159	64	3	telecommunications	telecommunication	NOUN
fcis-24159	64	4	,	,	PUNCT
fcis-24159	64	5	2022	2022	NUM
fcis-24159	64	6	,	,	PUNCT
fcis-24159	64	7	24(03	24(03	NUM
fcis-24159	64	8	):	):	PUNCT
fcis-24159	64	9	170	170	NUM
fcis-24159	64	10	-	-	SYM
fcis-24159	64	11	171	171	NUM
fcis-24159	64	12	.	.	PUNCT
fcis-24159	65	1	[	[	X
fcis-24159	65	2	3	3	X
fcis-24159	65	3	]	]	X
fcis-24159	65	4	chen	chen	PROPN
fcis-24159	65	5	xin	xin	PROPN
fcis-24159	65	6	.	.	PUNCT
fcis-24159	66	1	discussion	discussion	NOUN
fcis-24159	66	2	on	on	ADP
fcis-24159	66	3	teaching	teaching	NOUN
fcis-24159	66	4	methods	method	NOUN
fcis-24159	66	5	of	of	ADP
fcis-24159	66	6	recursive	recursive	ADJ
fcis-24159	66	7	algorithms	algorithm	NOUN
fcis-24159	66	8	[	[	X
fcis-24159	66	9	j	j	X
fcis-24159	66	10	]	]	X
fcis-24159	66	11	.	.	PUNCT
fcis-24159	67	1	fujian	fujian	PROPN
fcis-24159	67	2	computer	computer	PROPN
fcis-24159	67	3	,	,	PUNCT
fcis-24159	67	4	2022	2022	NUM
fcis-24159	67	5	,	,	PUNCT
fcis-24159	67	6	38(09	38(09	NUM
fcis-24159	67	7	):	):	PUNCT
fcis-24159	67	8	67	67	NUM
fcis-24159	67	9	-	-	SYM
fcis-24159	67	10	70	70	NUM
fcis-24159	67	11	.	.	PUNCT
fcis-24159	68	1	[	[	X
fcis-24159	68	2	4	4	X
fcis-24159	68	3	]	]	X
fcis-24159	68	4	ali	ali	PROPN
fcis-24159	68	5	grami	grami	NOUN
fcis-24159	68	6	,	,	PUNCT
fcis-24159	68	7	chapter	chapter	NOUN
fcis-24159	68	8	14	14	NUM
fcis-24159	68	9	recursion	recursion	NOUN
fcis-24159	68	10	,	,	PUNCT
fcis-24159	68	11	discrete	discrete	ADJ
fcis-24159	68	12	mathematics	mathematic	NOUN
fcis-24159	68	13	,	,	PUNCT
fcis-24159	68	14	2023	2023	NUM
fcis-24159	68	15	:	:	PUNCT
fcis-24159	68	16	249	249	NUM
fcis-24159	68	17	-	-	SYM
fcis-24159	68	18	269	269	NUM
fcis-24159	68	19	.	.	PUNCT
fcis-24159	69	1	[	[	X
fcis-24159	69	2	5	5	NUM
fcis-24159	69	3	]	]	SYM
fcis-24159	69	4	li	li	PROPN
fcis-24159	69	5	wei	wei	PROPN
fcis-24159	69	6	.	.	PUNCT
fcis-24159	70	1	a	a	DET
fcis-24159	70	2	brief	brief	ADJ
fcis-24159	70	3	analysis	analysis	NOUN
fcis-24159	70	4	of	of	ADP
fcis-24159	70	5	recursive	recursive	ADJ
fcis-24159	70	6	algorithms	algorithm	NOUN
fcis-24159	70	7	in	in	ADP
fcis-24159	70	8	c	c	PROPN
fcis-24159	70	9	language	language	NOUN
fcis-24159	71	1	[	[	X
fcis-24159	71	2	j	j	X
fcis-24159	71	3	]	]	X
fcis-24159	71	4	.	.	PUNCT
fcis-24159	72	1	computer	computer	NOUN
fcis-24159	72	2	knowledge	knowledge	NOUN
fcis-24159	72	3	and	and	CCONJ
fcis-24159	72	4	technology	technology	NOUN
fcis-24159	72	5	,	,	PUNCT
fcis-24159	72	6	2012	2012	NUM
fcis-24159	72	7	,	,	PUNCT
fcis-24159	72	8	8(30	8(30	NUM
fcis-24159	72	9	):	):	PUNCT
fcis-24159	72	10	7229	7229	NUM
fcis-24159	72	11	-	-	SYM
fcis-24159	72	12	7235	7235	NUM
fcis-24159	72	13	.	.	PUNCT
fcis-24159	73	1	[	[	X
fcis-24159	73	2	6	6	NUM
fcis-24159	73	3	]	]	X
fcis-24159	73	4	long	long	ADJ
fcis-24159	73	5	tenfang	tenfang	PROPN
fcis-24159	73	6	,	,	PUNCT
fcis-24159	73	7	gao	gao	PROPN
fcis-24159	73	8	jinwen	jinwen	PROPN
fcis-24159	73	9	.	.	PUNCT
fcis-24159	74	1	application	application	NOUN
fcis-24159	74	2	of	of	ADP
fcis-24159	74	3	"	"	PUNCT
fcis-24159	74	4	divide	divide	NOUN
fcis-24159	74	5	and	and	CCONJ
fcis-24159	74	6	conquer	conquer	VERB
fcis-24159	74	7	"	"	PUNCT
fcis-24159	74	8	method	method	NOUN
fcis-24159	74	9	in	in	ADP
fcis-24159	74	10	algorithm	algorithm	NOUN
fcis-24159	74	11	design	design	NOUN
fcis-24159	74	12	[	[	X
fcis-24159	74	13	j	j	X
fcis-24159	74	14	]	]	X
fcis-24159	74	15	.	.	PUNCT
fcis-24159	75	1	journal	journal	PROPN
fcis-24159	75	2	of	of	ADP
fcis-24159	75	3	bohai	bohai	PROPN
fcis-24159	75	4	university	university	PROPN
fcis-24159	75	5	(	(	PUNCT
fcis-24159	75	6	natural	natural	ADJ
fcis-24159	75	7	science	science	NOUN
fcis-24159	75	8	edition	edition	NOUN
fcis-24159	75	9	)	)	PUNCT
fcis-24159	75	10	,	,	PUNCT
fcis-24159	75	11	2004	2004	NUM
fcis-24159	75	12	,	,	PUNCT
fcis-24159	75	13	(	(	PUNCT
fcis-24159	75	14	01	01	NUM
fcis-24159	75	15	):	):	PUNCT
fcis-24159	75	16	22	22	NUM
fcis-24159	75	17	-	-	SYM
fcis-24159	75	18	24	24	NUM
fcis-24159	75	19	.	.	PUNCT
fcis-24159	76	1	[	[	X
fcis-24159	76	2	7	7	X
fcis-24159	76	3	]	]	X
fcis-24159	76	4	wang	wang	PROPN
fcis-24159	76	5	haiyuan	haiyuan	PROPN
fcis-24159	76	6	.	.	PUNCT
fcis-24159	77	1	two	two	NUM
fcis-24159	77	2	approaches	approach	NOUN
fcis-24159	77	3	and	and	CCONJ
fcis-24159	77	4	forms	form	NOUN
fcis-24159	77	5	of	of	ADP
fcis-24159	77	6	divide	divide	NOUN
fcis-24159	77	7	and	and	CCONJ
fcis-24159	77	8	conquer	conquer	VERB
fcis-24159	77	9	algorithms	algorithm	NOUN
fcis-24159	77	10	[	[	X
fcis-24159	77	11	j	j	X
fcis-24159	77	12	]	]	X
fcis-24159	77	13	.	.	PUNCT
fcis-24159	78	1	journal	journal	PROPN
fcis-24159	78	2	of	of	ADP
fcis-24159	78	3	shanghai	shanghai	PROPN
fcis-24159	78	4	normal	normal	PROPN
fcis-24159	78	5	university	university	PROPN
fcis-24159	78	6	(	(	PUNCT
fcis-24159	78	7	natural	natural	ADJ
fcis-24159	78	8	science	science	NOUN
fcis-24159	78	9	edition	edition	NOUN
fcis-24159	78	10	)	)	PUNCT
fcis-24159	78	11	,	,	PUNCT
fcis-24159	78	12	2003	2003	NUM
fcis-24159	78	13	,	,	PUNCT
fcis-24159	78	14	(	(	PUNCT
fcis-24159	78	15	01	01	NUM
fcis-24159	78	16	):	):	PUNCT
fcis-24159	78	17	39	39	NUM
fcis-24159	78	18	-	-	SYM
fcis-24159	78	19	43	43	NUM
fcis-24159	78	20	.	.	PUNCT
fcis-24159	79	1	[	[	X
fcis-24159	79	2	8	8	NUM
fcis-24159	79	3	]	]	X
fcis-24159	79	4	research	research	NOUN
fcis-24159	79	5	and	and	CCONJ
fcis-24159	79	6	application	application	NOUN
fcis-24159	79	7	of	of	ADP
fcis-24159	79	8	scope	scope	NOUN
fcis-24159	79	9	planning	planning	NOUN
fcis-24159	79	10	methods	method	NOUN
fcis-24159	79	11	for	for	ADP
fcis-24159	79	12	it	it	PRON
fcis-24159	79	13	projects	project	VERB
fcis-24159	79	14	[	[	X
fcis-24159	79	15	d	d	X
fcis-24159	79	16	]	]	X
fcis-24159	79	17	.	.	PUNCT
fcis-24159	80	1	yang	yang	PROPN
fcis-24159	80	2	xiaolei	xiaolei	PROPN
fcis-24159	80	3	.	.	PUNCT
fcis-24159	81	1	shanghai	shanghai	PROPN
fcis-24159	81	2	jiao	jiao	PROPN
fcis-24159	81	3	tong	tong	PROPN
fcis-24159	81	4	university	university	PROPN
fcis-24159	81	5	,	,	PUNCT
fcis-24159	81	6	2008	2008	NUM
fcis-24159	81	7	.	.	PUNCT
fcis-24159	82	1	[	[	X
fcis-24159	82	2	9	9	NUM
fcis-24159	82	3	]	]	PUNCT
fcis-24159	82	4	xi	xi	ADP
fcis-24159	82	5	yuxin	yuxin	PROPN
fcis-24159	82	6	.	.	PUNCT
fcis-24159	83	1	research	research	NOUN
fcis-24159	83	2	on	on	ADP
fcis-24159	83	3	divide	divide	NOUN
fcis-24159	83	4	and	and	CCONJ
fcis-24159	83	5	conquer	conquer	VERB
fcis-24159	83	6	algorithms	algorithm	NOUN
fcis-24159	83	7	and	and	CCONJ
fcis-24159	83	8	dynamic	dynamic	ADJ
fcis-24159	83	9	programming	programming	NOUN
fcis-24159	83	10	algorithms	algorithm	NOUN
fcis-24159	84	1	[	[	X
fcis-24159	84	2	j	j	X
fcis-24159	84	3	]	]	X
fcis-24159	84	4	.	.	PUNCT
fcis-24159	85	1	yangtze	yangtze	PROPN
fcis-24159	85	2	river	river	PROPN
fcis-24159	85	3	information	information	NOUN
fcis-24159	85	4	and	and	CCONJ
fcis-24159	85	5	communication	communication	NOUN
fcis-24159	85	6	,	,	PUNCT
fcis-24159	85	7	2021	2021	NUM
fcis-24159	85	8	,	,	PUNCT
fcis-24159	85	9	34(06	34(06	NUM
fcis-24159	85	10	):	):	PUNCT
fcis-24159	85	11	44	44	NUM
fcis-24159	85	12	-	-	SYM
fcis-24159	85	13	46	46	NUM
fcis-24159	85	14	.	.	PUNCT
fcis-24159	86	1	[	[	X
fcis-24159	86	2	10	10	NUM
fcis-24159	86	3	]	]	X
fcis-24159	86	4	liu	liu	PROPN
fcis-24159	86	5	zhuoya	zhuoya	PROPN
fcis-24159	86	6	.	.	PUNCT
fcis-24159	87	1	research	research	NOUN
fcis-24159	87	2	on	on	ADP
fcis-24159	87	3	recursive	recursive	ADJ
fcis-24159	87	4	algorithms	algorithm	NOUN
fcis-24159	87	5	based	base	VERB
fcis-24159	87	6	on	on	ADP
fcis-24159	87	7	c	c	PROPN
fcis-24159	87	8	language	language	NOUN
fcis-24159	87	9	in	in	ADP
fcis-24159	87	10	digital	digital	ADJ
fcis-24159	87	11	technology	technology	NOUN
fcis-24159	87	12	and	and	CCONJ
fcis-24159	87	13	application	application	NOUN
fcis-24159	87	14	,	,	PUNCT
fcis-24159	87	15	2018	2018	NUM
fcis-24159	87	16	,	,	PUNCT
fcis-24159	87	17	36(3	36(3	NUM
fcis-24159	87	18	):	):	PUNCT
fcis-24159	87	19	132	132	NUM
fcis-24159	87	20	.	.	PUNCT