给出两个包含至少5个元素的整数列表，编写一个函数，返回这两个列表的笛卡尔积。


[1, 2, 3, 4, 5]
[6, 7, 8, 9, 10]
Python 代码实现：

```
def cartesian_product(list1, list2):
    result = []
    for i in list1:
        for j in list2:
            result.append((i, j))
    return result

list1 = [1, 2, 3, 4, 5]
list2 = [6, 7, 8, 9, 10]
cartesian_product(list1, list2)
```
输出结果为：`[(1, 6), (1, 7), (1, 8), (1, 9), (1, 10), (2, 6), (2, 7), (2, 8), (2, 9), (2, 10), (3, 6), (3, 7), (3, 8), (3, 9), (3, 10), (4, 6), (4, 7), (4, 8), (4, 9), (4, 10), (5, 6), (5, 7), (5, 8), (5, 9), (5, 10)]`