第八天算法设计

顺序表遍历算法设计：

SequenceTraversal类
java
package suanfa;

public class SequenceTraversal {

// 遍历a中元素并打印每个元素
public static void traverse(Comparable[] a) {
    for (int i = 0; i < a.length; i++) {
        System.out.println(a[i]);
    }
}

}
SequenceTraversalTest类
java
package suanfa;

public class SequenceTraversalTest {
public static void main(String[] args) {
Integer[] arr = {4, 5, 6, 3, 2, 1};
// 调用traverse方法进行顺序遍历
SequenceTraversal.traverse(arr);
}
}
录制: untitled2 – Insertion.java
录制文件：https://meeting.tencent.com/crm/KzGGkGE85d