<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[FenRir0的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/FenRir0</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; FenRir0]]></copyright><item><title><![CDATA[Java遗传算法（GA）简单例子]]></title><link>https://blog.youkuaiyun.com/FenRir0/article/details/115440065</link><guid>https://blog.youkuaiyun.com/FenRir0/article/details/115440065</guid><author>FenRir0</author><pubDate>Mon, 05 Apr 2021 11:50:24 +0800</pubDate><description><![CDATA[文章目录前言一、解决的函数二、遗传和变异算子1.交叉2.变异源代码

前言
Java遗传算法（GA）简单例子
采用的是实数编码
一、解决的函数
f（x） = x1²+x2²+x3²
    //计算适应度，函数式的解
    public static double fitness(double[] individual, int N) {
        double f = 0;
        for (int i = 0; i &lt; N; i++) {
            f += indi]]></description><category></category></item><item><title><![CDATA[Java二分搜索]]></title><link>https://blog.youkuaiyun.com/FenRir0/article/details/114637330</link><guid>https://blog.youkuaiyun.com/FenRir0/article/details/114637330</guid><author>FenRir0</author><pubDate>Wed, 10 Mar 2021 16:18:43 +0800</pubDate><description><![CDATA[Java二分搜索
Java二分搜索适用于已经排列好的数组，若数组未排序可用Arrays.sort()进行排序
import java.util.Arrays;

public class Case {
    public static void main(String[] args) {
        int[] arr = {33, 23, 99, 87, 91, 78, 45};
        //排序
        Arrays.sort(arr);
        //打印
        ]]></description><category></category></item></channel></rss>