goldsearch.jcu

来自「用黄金分割搜索算法求cos(x),x∈[-π/2,π/2]的最大值」· JCU 代码 · 共 24 行

<?xml?>
<workspace_user>
	<active_project>
		<label>BinarySearch</label>
	</active_project>
	<projects>
		<project>
			<label>BinarySearch</label>
			<showfiles>false</showfiles>
		</project>
		<project>
			<label>GoldSearch</label>
			<showfiles>false</showfiles>
		</project>
	</projects>
	<open_files>
		<docitem>
			<path>..\斗怂\BinarySearch.java</path>
			<source>true</source>
			<index>0</index>
			<active>true</active>
		</docitem>
	</open_files>
</workspace_user>